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 13, 2026 23:37Victor MerckléVictor MerckléScore: 7,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 23:377,56772,692,27062,809,00002,113,536
2May 13, 2026 23:377,57071,734,21361,836,0001,002,0002,113,536
3May 13, 2026 23:377,57072,202,22562,832,00002,113,536
4May 13, 2026 23:377,57270,973,95161,839,0001,012,0002,113,536
5May 13, 2026 23:377,57372,029,02161,838,0001,021,0002,113,536
6May 13, 2026 23:377,58072,634,41661,912,0001,008,0002,113,536
7May 13, 2026 23:377,59770,908,11563,056,00002,113,536
8May 13, 2026 23:377,63371,138,31462,349,0001,005,0002,113,536
9May 13, 2026 23:377,70571,222,48362,949,0001,005,0002,113,536