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 23:38Victor MerckléVictor MerckléScore: 28,929Success
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 23:3928,846247,460,424238,287,0001,139,0002,117,632stderr
2Jul 6, 2026 23:3928,870247,647,595238,517,0001,106,0002,117,632stderr
3Jul 6, 2026 23:3928,884247,622,806238,618,0001,127,0002,117,632stderr
4Jul 6, 2026 23:3928,895247,674,435238,746,0001,085,0002,117,632stderr
5Jul 6, 2026 23:3928,929248,420,691239,104,0001,011,0002,117,632stderr
6Jul 6, 2026 23:3928,932248,281,226239,114,0001,026,0002,117,632stderr
7Jul 6, 2026 23:3928,933248,217,002239,052,0001,098,0002,117,632stderr
8Jul 6, 2026 23:3928,975248,405,544239,250,0001,246,0002,117,632stderr
9Jul 6, 2026 23:3929,012248,897,702239,747,0001,058,0002,117,632stderr