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 15, 2026 19:17Milo PresedoMilo PresedoScore: 7,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 19:187,98174,659,01865,089,0001,160,0002,113,536
2May 15, 2026 19:187,98373,662,44265,119,0001,146,0002,113,536
3May 15, 2026 19:187,98676,675,96765,125,0001,167,0002,113,536
4May 15, 2026 19:187,98776,606,07865,138,0001,157,0002,113,536
5May 15, 2026 19:187,98775,745,86565,108,0001,187,0002,113,536
6May 15, 2026 19:187,98876,316,22965,140,0001,168,0002,113,536
7May 15, 2026 19:188,00175,847,13665,298,0001,115,0002,113,536
8May 15, 2026 19:188,02075,705,75965,409,0001,159,0002,113,536
9May 15, 2026 19:188,42877,874,78468,803,0001,152,0002,113,536