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:59Josu San MartinJosu San MartinScore: 4,251Success
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:594,22749,823,71033,980,0001,106,0002,486,272
2May 10, 2026 04:594,24750,704,82234,070,0001,181,0002,490,368
3May 10, 2026 04:594,24949,871,75034,237,0001,037,0002,486,272
4May 10, 2026 04:594,25051,029,54734,219,0001,057,0002,482,176
5May 10, 2026 04:594,25149,962,31734,232,0001,057,0002,482,176
6May 10, 2026 04:594,25251,622,68734,242,0001,053,0002,490,368
7May 10, 2026 04:594,25650,086,17634,266,0001,065,0002,494,464
8May 10, 2026 04:594,27949,537,61234,482,0001,041,0002,490,368
9May 10, 2026 04:594,29248,328,02934,571,0001,053,0002,490,368