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 9, 2026 18:58Victor MerckléVictor MerckléScore: 14,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 18:5914,041124,404,008115,426,0001,118,0002,117,632stderr
2Jul 9, 2026 18:5914,082124,835,568115,879,0001,005,0002,117,632stderr
3Jul 9, 2026 18:5914,083124,848,403115,879,0001,015,0002,117,632stderr
4Jul 9, 2026 18:5914,119125,786,362116,186,0001,004,0002,117,632stderr
5Jul 9, 2026 18:5914,153125,948,788116,454,0001,023,0002,117,632stderr
6Jul 9, 2026 18:5914,161125,490,346116,520,0001,017,0002,117,632stderr
7Jul 9, 2026 18:5914,192125,661,283116,733,0001,062,0002,117,632stderr
8Jul 9, 2026 18:5914,201126,239,209116,833,0001,039,0002,117,632stderr
9Jul 9, 2026 18:5914,816130,940,637121,956,0001,023,0002,117,632stderr