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 listSep 12, 2026 16:12Kevin HeaveyKevin HeaveyScore: 3,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 16:133,71639,745,16429,644,0001,207,0002,113,536
2Sep 12, 2026 16:133,75639,906,45530,148,0001,034,0002,113,536
3Sep 12, 2026 16:133,81240,498,07930,602,0001,043,0002,113,536
4Sep 12, 2026 16:133,82940,525,04830,707,0001,078,0002,113,536
5Sep 12, 2026 16:133,83240,605,22530,769,0001,037,0002,113,536
6Sep 12, 2026 16:133,86040,724,50930,994,0001,051,0002,113,536
7Sep 12, 2026 16:133,88042,588,34231,173,0001,038,0002,113,536
8Sep 12, 2026 16:133,88241,199,84530,982,0001,241,0002,113,536
9Sep 12, 2026 16:133,88341,115,86331,177,0001,052,0002,113,536