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 11, 2026 21:16Victor MerckléVictor MerckléScore: 10,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 21:1910,088101,688,39082,719,0001,015,0002,117,632stderr
2Sep 11, 2026 21:1910,103101,965,74382,830,0001,029,0002,117,632stderr
3Sep 11, 2026 21:1910,130102,326,27883,001,0001,079,0002,117,632stderr
4Sep 11, 2026 21:1910,137102,475,56783,134,0001,010,0002,117,632stderr
5Sep 11, 2026 21:1910,146103,333,48883,204,0001,014,0002,117,632stderr
6Sep 11, 2026 21:1910,160102,538,59383,313,0001,017,0002,117,632stderr
7Sep 11, 2026 21:1910,177102,705,25283,373,0001,102,0002,117,632stderr
8Sep 11, 2026 21:1910,245103,345,15383,947,0001,087,0002,117,632stderr
9Sep 11, 2026 21:1910,261103,411,00184,152,0001,021,0002,117,632stderr