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 20, 2026 10:46Victor MerckléVictor MerckléScore: 5,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:475,67256,788,60346,053,0001,032,0002,113,536
2May 20, 2026 10:475,67454,905,81446,090,0001,008,0002,113,536
3May 20, 2026 10:475,83856,980,30847,417,0001,042,0002,113,536
4May 20, 2026 10:475,84856,396,31447,535,0001,004,0002,113,536
5May 20, 2026 10:475,85858,119,30347,614,0001,010,0002,113,536
6May 20, 2026 10:475,86958,138,11447,692,0001,026,0002,113,536
7May 20, 2026 10:475,87256,932,70747,716,0001,029,0002,113,536
8May 20, 2026 10:475,90056,794,27947,936,0001,035,0002,113,536
9May 20, 2026 10:475,94367,706,88848,303,0001,029,0002,113,536