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 listJul 16, 2026 04:19Kevin HeaveyKevin HeaveyScore: 3,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 04:203,67840,234,62529,508,0001,025,0002,117,632
2Jul 16, 2026 04:203,68740,268,10129,584,0001,021,0002,117,632
3Jul 16, 2026 04:203,70140,511,57029,693,0001,026,0002,117,632
4Jul 16, 2026 04:203,70140,415,06729,690,0001,029,0002,117,632
5Jul 16, 2026 04:203,70240,700,87829,704,0001,025,0002,117,632
6Jul 16, 2026 04:203,76140,959,50730,184,0001,038,0002,117,632
7Jul 16, 2026 04:203,77541,023,02630,292,0001,046,0002,117,632
8Jul 16, 2026 04:203,77641,055,36730,308,0001,040,0002,117,632
9Jul 16, 2026 04:203,78541,212,79530,379,0001,041,0002,117,632