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 13, 2026 18:07Aleksei ShahoikaAleksei ShahoikaScore: 14,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:0714,331127,886,48496,640,00022,310,0002,113,536
2May 13, 2026 18:0714,343129,431,22796,931,00022,119,0002,113,536
3May 13, 2026 18:0714,377131,002,38396,852,00022,484,0002,113,536
4May 13, 2026 18:0714,409128,550,87896,691,00022,908,0002,113,536
5May 13, 2026 18:0714,478130,651,13496,797,00023,372,0002,113,536
6May 13, 2026 18:0714,481130,765,18296,589,00023,604,0002,113,536
7May 13, 2026 18:0714,526131,174,11096,745,00023,824,0002,113,536
8May 13, 2026 18:0714,530129,330,81796,940,00023,665,0002,113,536
9May 13, 2026 18:0714,544129,534,60196,683,00024,039,0002,113,536