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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 21:5610,23296,514,65883,831,0001,098,0002,113,536
2May 11, 2026 21:5610,23393,727,21783,844,0001,093,0002,113,536
3May 11, 2026 21:5610,24594,556,74883,867,0001,173,0002,113,536
4May 11, 2026 21:5610,24696,017,69083,874,0001,169,0002,113,536
5May 11, 2026 21:5610,24695,911,99583,875,0001,175,0002,113,536
6May 11, 2026 21:5610,25596,369,04484,108,0001,013,0002,113,536
7May 11, 2026 21:5610,25695,653,76984,084,0001,048,0002,113,536
8May 11, 2026 21:5610,25693,799,80584,044,0001,089,0002,113,536
9May 11, 2026 21:5610,25895,582,39484,117,0001,025,0002,113,536