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 10, 2026 03:51Josu San MartinJosu San MartinScore: 4,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 03:514,35452,124,45935,057,0001,082,0002,555,904
2May 10, 2026 03:514,36853,379,44735,144,0001,112,0002,555,904
3May 10, 2026 03:514,37653,039,22935,215,0001,114,0002,543,616
4May 10, 2026 03:514,37654,388,33135,168,0001,154,0002,543,616
5May 10, 2026 03:514,37749,105,29435,174,0001,157,0002,543,616
6May 10, 2026 03:514,38851,119,06735,258,0001,167,0002,551,808
7May 10, 2026 03:514,39150,296,00035,416,0001,033,0002,551,808
8May 10, 2026 03:514,40052,996,48935,485,0001,041,0002,555,904
9May 10, 2026 03:514,40252,346,49035,492,0001,052,0002,555,904