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 listSep 6, 2026 11:14Kevin HeaveyKevin HeaveyScore: 3,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 11:173,52337,569,59028,209,0001,039,0002,113,536
2Sep 6, 2026 11:173,54437,748,00828,218,0001,203,0002,113,536
3Sep 6, 2026 11:173,54837,730,05328,251,0001,202,0002,113,536
4Sep 6, 2026 11:173,55337,841,78328,314,0001,177,0002,113,536
5Sep 6, 2026 11:173,56137,865,67928,526,0001,033,0002,113,536
6Sep 6, 2026 11:173,56237,837,49728,524,0001,041,0002,113,536
7Sep 6, 2026 11:173,73539,298,81029,808,0001,197,0002,113,536
8Sep 6, 2026 11:173,79439,779,29030,304,0001,190,0002,113,536
9Sep 6, 2026 11:173,80739,975,44330,568,0001,036,0002,113,536