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 6, 2026 22:08boop34boop34Score: 77,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:0877,453653,112,514558,266,00084,598,0002,113,536
2Jul 6, 2026 22:0877,544655,462,335559,428,00084,190,0002,113,536
3Jul 6, 2026 22:0877,606653,950,896560,261,00083,875,0002,113,536
4Jul 6, 2026 22:0877,659654,888,256559,575,00085,001,0002,113,536
5Jul 6, 2026 22:0877,686655,167,092560,511,00084,290,0002,113,536
6Jul 6, 2026 22:0877,714655,191,524560,451,00084,580,0002,113,536
7Jul 6, 2026 22:0878,430661,092,699562,207,00088,770,0002,113,536
8Jul 6, 2026 22:0878,482661,081,630562,668,00088,733,0002,113,536
9Jul 6, 2026 22:0878,590662,550,231563,091,00089,213,0002,113,536