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 19, 2026 14:18Victor MerckléVictor MerckléScore: 6,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:205,89457,366,69347,900,0001,026,0002,113,536
2May 19, 2026 14:205,95559,340,19448,405,0001,023,0002,113,536
3May 19, 2026 14:206,01058,955,40948,866,0001,023,0002,113,536
4May 19, 2026 14:206,03259,608,29349,033,0001,035,0002,113,536
5May 19, 2026 14:206,04060,016,31349,105,0001,028,0002,113,536
6May 19, 2026 14:206,04260,895,62549,139,0001,016,0002,113,536
7May 19, 2026 14:206,09761,226,35849,584,0001,027,0002,113,536
8May 19, 2026 14:206,12759,935,53349,836,0001,021,0002,113,536
9May 19, 2026 14:206,14259,657,84349,949,0001,031,0002,113,536