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 listApr 12, 2026 20:36Benn TanBenn TanScore: 6,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 20:366,98184,372,76355,948,0001,998,0002,293,760
2Apr 12, 2026 20:366,98182,340,72155,944,0001,998,0002,293,760
3Apr 12, 2026 20:366,98583,758,06355,973,0001,999,0002,293,760
4Apr 12, 2026 20:366,99285,344,51556,036,0002,001,0002,293,760
5Apr 12, 2026 20:366,99382,715,96056,042,0002,001,0002,293,760
6Apr 12, 2026 20:366,99885,426,95357,084,0001,001,0002,293,760
7Apr 12, 2026 20:367,08283,885,18256,785,0001,992,0002,293,760
8Apr 12, 2026 20:367,13885,871,20557,236,0002,008,0002,269,184
9Apr 12, 2026 20:367,14083,206,83957,256,0002,009,0002,293,760