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 04:21Josu San MartinJosu San MartinScore: 4,457Success
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 04:214,44452,231,13835,853,0001,034,0002,543,616
2May 10, 2026 04:214,45052,623,64835,907,0001,036,0002,560,000
3May 10, 2026 04:214,45056,155,43835,904,0001,035,0002,547,712
4May 10, 2026 04:214,45654,286,91835,950,0001,039,0002,555,904
5May 10, 2026 04:214,45754,400,88935,967,0001,034,0002,539,520
6May 10, 2026 04:214,46250,896,87236,003,0001,037,0002,551,808
7May 10, 2026 04:214,46855,364,14936,048,0001,039,0002,555,904
8May 10, 2026 04:214,46953,446,97436,063,0001,035,0002,543,616
9May 10, 2026 04:214,49452,670,14336,265,0001,037,0002,547,712