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 12, 2026 19:18Victor MerckléVictor MerckléScore: 9,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 19:189,36186,479,60776,533,0001,166,0002,113,536
2May 12, 2026 19:189,36386,628,27076,552,0001,167,0002,113,536
3May 12, 2026 19:189,36387,014,38076,554,0001,165,0002,113,536
4May 12, 2026 19:189,36699,810,54476,585,0001,157,0002,113,536
5May 12, 2026 19:189,36799,644,94876,556,0001,192,0002,113,536
6May 12, 2026 19:189,36988,261,96576,579,0001,186,0002,113,536
7May 12, 2026 19:189,36999,909,64776,757,0001,008,0002,113,536
8May 12, 2026 19:189,37087,101,17776,773,0001,004,0002,113,536
9May 12, 2026 19:189,38287,959,45676,764,0001,112,0002,113,536