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 9, 2026 22:24Josu San MartinJosu San MartinScore: 5,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 22:255,25159,224,46842,524,0001,060,0002,551,808
2May 9, 2026 22:255,26262,054,91942,622,0001,060,0002,543,616
3May 9, 2026 22:255,35658,374,91943,409,0001,053,0002,551,808
4May 9, 2026 22:255,35861,220,90343,384,0001,088,0002,547,712
5May 9, 2026 22:255,46961,047,94944,323,0001,073,0002,543,616
6May 9, 2026 22:255,47361,170,70044,384,0001,049,0002,551,808
7May 9, 2026 22:255,47659,662,04844,390,0001,069,0002,547,712
8May 9, 2026 22:255,55361,927,21545,049,0001,049,0002,555,904
9May 9, 2026 22:255,71862,159,81046,412,0001,052,0002,547,712