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 25, 2026 18:16Maya RebholzMaya RebholzScore: 6,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 18:176,71867,585,67250,522,0005,242,0002,117,632
2May 25, 2026 18:176,75868,409,90450,920,0005,172,0002,113,536
3May 25, 2026 18:176,79168,068,43150,920,0005,446,0002,113,536
4May 25, 2026 18:176,87768,197,81151,845,0005,240,0002,113,536
5May 25, 2026 18:176,91669,169,38852,128,0005,283,0002,117,632
6May 25, 2026 18:176,92168,992,85451,906,0005,544,0002,113,536
7May 25, 2026 18:176,93769,065,52752,348,0005,237,0002,113,536
8May 25, 2026 18:176,94866,968,87452,392,0005,284,0002,117,632
9May 25, 2026 18:176,99169,399,10852,776,0005,252,0002,113,536