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 listAug 28, 2026 18:42Victor MerckléVictor MerckléScore: 6,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 18:426,31362,698,72851,341,0001,057,0002,117,632stderr
2Aug 28, 2026 18:426,32361,521,81051,419,0001,070,0002,117,632stderr
3Aug 28, 2026 18:426,32761,579,35251,427,0001,091,0002,117,632stderr
4Aug 28, 2026 18:426,33461,620,14951,510,0001,068,0002,117,632stderr
5Aug 28, 2026 18:426,36861,882,03451,789,0001,067,0002,117,632stderr
6Aug 28, 2026 18:426,38861,169,34951,936,0001,088,0002,117,632stderr
7Aug 28, 2026 18:426,39562,135,72652,026,0001,057,0002,117,632stderr
8Aug 28, 2026 18:426,40262,199,17852,083,0001,055,0002,117,632stderr
9Aug 28, 2026 18:426,44161,626,66652,184,0001,277,0002,117,632stderr