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 5, 2026 21:04Kevin HeaveyKevin HeaveyScore: 4,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:064,56247,557,63336,678,0001,187,0002,117,632
2Jul 5, 2026 21:064,60947,886,20237,241,0001,016,0002,117,632
3Jul 5, 2026 21:064,63347,996,88437,284,0001,177,0002,117,632
4Jul 5, 2026 21:064,66248,293,46137,548,0001,152,0002,117,632
5Jul 5, 2026 21:064,67148,454,34237,514,0001,262,0002,117,632
6Jul 5, 2026 21:064,67248,272,50637,606,0001,172,0002,117,632
7Jul 5, 2026 21:064,67948,360,03637,669,0001,169,0002,117,632
8Jul 5, 2026 21:064,79549,294,07538,633,0001,168,0002,117,632
9Jul 5, 2026 21:064,90650,304,72639,562,0001,158,0002,117,632