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 02:45Josu San MartinJosu San MartinScore: 4,747Success
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 02:464,62255,193,47737,246,0001,117,0002,547,712
2May 10, 2026 02:464,66356,536,49837,582,0001,121,0002,555,904
3May 10, 2026 02:464,71256,368,83237,979,0001,131,0002,551,808
4May 10, 2026 02:464,74555,978,94638,242,0001,142,0002,560,000
5May 10, 2026 02:464,74755,028,95338,258,0001,149,0002,547,712
6May 10, 2026 02:464,75361,153,31338,303,0001,154,0002,543,616
7May 10, 2026 02:464,76756,299,75438,414,0001,158,0002,543,616
8May 10, 2026 02:464,79855,754,39138,688,0001,136,0002,543,616
9May 10, 2026 02:464,79958,379,05738,680,0001,152,0002,551,808