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 4, 2026 07:59Victor MerckléVictor MerckléScore: 3,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 08:043,63138,557,20229,023,0001,122,0002,117,632stderr
2Sep 4, 2026 08:043,63138,786,77728,996,0001,147,0002,117,632stderr
3Sep 4, 2026 08:043,63238,563,00429,016,0001,135,0002,117,632stderr
4Sep 4, 2026 08:043,65038,697,03129,212,0001,083,0002,117,632stderr
5Sep 4, 2026 08:043,65838,763,59329,224,0001,142,0002,117,632stderr
6Sep 4, 2026 08:043,67038,815,73229,327,0001,141,0002,117,632stderr
7Sep 4, 2026 08:043,68338,953,70129,493,0001,079,0002,117,632stderr
8Sep 4, 2026 08:043,70639,784,68429,591,0001,171,0002,117,632stderr
9Sep 4, 2026 08:043,71239,262,10329,579,0001,234,0002,117,632stderr