Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 27, 2026 07:10Victor MerckléVictor MerckléScore: 4,908Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 07:104,87048,840,69039,362,0001,059,0002,113,536
2Aug 27, 2026 07:104,88848,832,36439,526,0001,049,0002,113,536
3Aug 27, 2026 07:104,89548,817,22839,520,0001,109,0002,113,536
4Aug 27, 2026 07:104,90048,879,19439,594,0001,080,0002,113,536
5Aug 27, 2026 07:104,90848,889,57739,663,0001,079,0002,113,536
6Aug 27, 2026 07:104,92149,044,38339,797,0001,052,0002,113,536
7Aug 27, 2026 07:105,00249,744,14740,429,0001,090,0002,113,536
8Aug 27, 2026 07:105,03450,073,15140,699,0001,084,0002,113,536
9Aug 27, 2026 07:105,32852,528,57043,173,0001,054,0002,113,536