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 24, 2026 13:35Victor MerckléVictor MerckléScore: 7,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 13:367,78774,439,85663,593,0001,041,0002,113,536
2May 24, 2026 13:367,79674,134,50163,549,0001,161,0002,113,536
3May 24, 2026 13:367,87373,473,30064,291,0001,055,0002,113,536
4May 24, 2026 13:367,89575,188,69364,483,0001,048,0002,113,536
5May 24, 2026 13:367,90575,221,15264,578,0001,041,0002,113,536
6May 24, 2026 13:367,92973,645,40764,761,0001,051,0002,113,536
7May 24, 2026 13:367,94273,690,51964,865,0001,057,0002,113,536
8May 24, 2026 13:367,95374,656,10864,976,0001,041,0002,113,536
9May 24, 2026 13:367,95476,065,71364,957,0001,065,0002,113,536