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 listJul 5, 2026 19:06Victor MerckléVictor MerckléScore: 8,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 19:078,69981,564,12571,129,0001,075,0002,117,632stderr
2Jul 5, 2026 19:078,70880,331,33971,206,0001,077,0002,117,632stderr
3Jul 5, 2026 19:078,71080,374,76871,203,0001,090,0002,117,632stderr
4Jul 5, 2026 19:078,71080,326,93171,204,0001,093,0002,117,632stderr
5Jul 5, 2026 19:078,71280,367,92471,225,0001,090,0002,117,632stderr
6Jul 5, 2026 19:078,71280,406,06971,166,0001,149,0002,117,632stderr
7Jul 5, 2026 19:078,71580,434,90871,327,0001,008,0002,117,632stderr
8Jul 5, 2026 19:078,72680,478,17571,424,0001,008,0002,117,632stderr
9Jul 5, 2026 19:078,73480,574,84471,339,0001,154,0002,117,632stderr