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:39M-RochatM-RochatScore: 8,811Success
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:398,78782,875,40271,924,0001,013,0002,113,536
2May 20, 2026 10:398,80384,684,73772,058,0001,013,0002,113,536
3May 20, 2026 10:398,80583,022,85572,071,0001,013,0002,113,536
4May 20, 2026 10:398,80784,648,15872,089,0001,013,0002,113,536
5May 20, 2026 10:398,81183,613,09472,123,0001,014,0002,113,536
6May 20, 2026 10:398,81582,514,13372,152,0001,014,0002,113,536
7May 20, 2026 10:398,81684,223,90872,161,0001,013,0002,113,536
8May 20, 2026 10:398,82084,080,06872,201,0001,013,0002,113,536
9May 20, 2026 10:398,91185,357,91472,952,0001,013,0002,113,536