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 8, 2026 06:26Victor MerckléVictor MerckléScore: 3,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 06:323,56138,035,33529,557,000024,576stderr
2Sep 8, 2026 06:323,58638,929,64828,736,0001,032,00024,576stderr
3Sep 8, 2026 06:323,59138,320,86029,811,000024,576stderr
4Sep 8, 2026 06:323,61239,281,99729,984,000024,576stderr
5Sep 8, 2026 06:323,62038,563,57730,047,000024,576stderr
6Sep 8, 2026 06:323,63139,295,09129,104,0001,034,00024,576stderr
7Sep 8, 2026 06:323,63238,750,24729,125,0001,022,00024,576stderr
8Sep 8, 2026 06:323,65439,520,20329,322,0001,009,00024,576stderr
9Sep 8, 2026 06:323,66738,951,58529,355,0001,088,0002,117,632stderr