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 listJan 3, 2026 02:58Josu San MartinJosu San MartinScore: 5,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 02:585,62275,250,37846,661,00002,359,296
2Jan 3, 2026 02:585,75974,571,17445,811,0001,991,0002,289,664
3Jan 3, 2026 02:585,77673,137,32446,939,000998,0002,473,984
4Jan 3, 2026 02:585,77774,943,78546,951,000998,0002,371,584
5Jan 3, 2026 02:585,85075,522,89848,555,00002,281,472
6Jan 3, 2026 02:585,91770,671,82348,111,0001,002,0002,293,760