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 listApr 6, 2026 14:14Danylo MocherniukDanylo MocherniukScore: 7,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 14:147,60293,614,33161,093,0002,003,0002,297,856
2Apr 6, 2026 14:147,60582,911,87460,113,0003,005,0002,297,856
3Apr 6, 2026 14:147,68689,226,70462,796,000996,0002,297,856
4Apr 6, 2026 14:147,82587,783,52562,950,0001,998,0002,297,856
5Apr 6, 2026 14:147,84690,301,70062,114,0003,005,0002,445,312
6Apr 6, 2026 14:147,89792,308,18863,529,0002,016,0002,347,008