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 listFeb 18, 2026 18:27wnwnScore: 7,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:276,50075,278,99051,951,0001,998,0002,502,656
2Feb 18, 2026 18:276,51479,558,87752,067,0002,002,0002,306,048
3Feb 18, 2026 18:276,66973,205,05953,342,0002,012,0002,527,232
4Feb 18, 2026 18:277,36880,539,31659,150,0002,005,0002,510,848
5Feb 18, 2026 18:277,44891,550,44659,822,0001,994,0002,437,120
6Feb 18, 2026 18:277,47787,595,65361,059,0001,000,0002,514,944