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:17Josu San MartinJosu San MartinScore: 4,480Success
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:174,44453,232,11235,779,0001,113,0002,555,904
2May 10, 2026 04:174,46354,650,48236,009,0001,039,0002,551,808
3May 10, 2026 04:174,46852,921,59936,024,0001,063,0002,547,712
4May 10, 2026 04:174,47952,248,14836,138,0001,042,0002,547,712
5May 10, 2026 04:174,48052,750,77836,160,0001,030,0002,551,808
6May 10, 2026 04:174,48052,243,53836,164,0001,027,0002,539,520
7May 10, 2026 04:174,48052,804,78736,137,0001,048,0002,547,712
8May 10, 2026 04:174,48353,834,95236,176,0001,034,0002,547,712
9May 10, 2026 04:174,51653,686,97836,277,0001,209,0002,555,904