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 11, 2026 15:51wnwnScore: 3,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:523,28036,592,26427,231,00002,113,536
2May 11, 2026 15:523,28636,907,30027,276,00002,113,536
3May 11, 2026 15:523,29034,703,97727,307,00002,113,536
4May 11, 2026 15:523,29635,991,63827,361,00002,113,536
5May 11, 2026 15:523,30535,054,67426,423,0001,011,0002,113,536
6May 11, 2026 15:523,42336,794,47527,415,0001,001,0002,113,536
7May 11, 2026 15:523,43036,788,55128,476,00002,113,536
8May 11, 2026 15:523,43038,369,27328,469,00002,113,536
9May 11, 2026 15:523,44938,618,31227,627,0001,007,0002,113,536