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 16:53Victor MerckléVictor MerckléScore: 3,737Success
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 16:543,70239,497,43829,571,0001,161,0002,113,536
2Aug 27, 2026 16:543,71239,888,71029,538,0001,275,0002,113,536
3Aug 27, 2026 16:543,71839,151,01829,771,0001,089,0002,113,536
4Aug 27, 2026 16:543,72239,075,33129,768,0001,129,0002,113,536
5Aug 27, 2026 16:543,73739,325,20829,861,0001,159,0002,113,536
6Aug 27, 2026 16:543,74239,432,88229,976,0001,090,0002,113,536
7Aug 27, 2026 16:543,77239,621,20830,132,0001,182,0002,113,536
8Aug 27, 2026 16:543,89441,326,31731,218,0001,108,0002,113,536
9Aug 27, 2026 16:544,03041,749,86232,367,0001,088,0002,113,536