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 listMay 21, 2026 13:55Victor MerckléVictor MerckléScore: 4,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 13:564,91950,470,19439,778,0001,054,0002,113,536
2May 21, 2026 13:564,92750,661,24639,840,0001,055,0002,113,536
3May 21, 2026 13:564,93550,922,68339,909,0001,057,0002,113,536
4May 21, 2026 13:564,93649,826,98439,938,0001,032,0002,113,536
5May 21, 2026 13:564,95048,862,87140,069,0001,016,0002,113,536
6May 21, 2026 13:564,98350,100,38440,327,0001,040,0002,113,536
7May 21, 2026 13:565,04349,695,26640,781,0001,078,0002,113,536
8May 21, 2026 13:565,05552,429,33940,897,0001,067,0002,113,536
9May 21, 2026 13:565,05649,796,37940,914,0001,051,0002,113,536