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 6, 2026 19:53Victor MerckléVictor MerckléScore: 98,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 19:5498,424825,062,594815,853,0001,073,0002,117,632stderr
2Jul 6, 2026 19:5498,464826,498,605816,217,0001,040,0002,117,632stderr
3Jul 6, 2026 19:5498,520825,540,332816,717,0001,002,0002,117,632stderr
4Jul 6, 2026 19:5498,524826,001,869816,581,0001,175,0002,117,632stderr
5Jul 6, 2026 19:5498,546826,025,889816,896,0001,042,0002,117,632stderr
6Jul 6, 2026 19:5498,564826,257,421817,064,0001,020,0002,117,632stderr
7Jul 6, 2026 19:5498,572826,039,826817,022,0001,130,0002,117,632stderr
8Jul 6, 2026 19:5498,604828,804,733817,406,0001,012,0002,117,632stderr
9Jul 6, 2026 19:5498,707827,463,939818,250,0001,021,0002,117,632stderr