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:13Victor MerckléVictor MerckléScore: 7,034Success
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:147,03066,462,99357,227,0001,128,0002,117,632stderr
2Jul 5, 2026 19:147,03166,357,12457,314,0001,046,0002,117,632stderr
3Jul 5, 2026 19:147,03266,410,89257,246,0001,126,0002,117,632stderr
4Jul 5, 2026 19:147,03266,441,87457,311,0001,060,0002,117,632stderr
5Jul 5, 2026 19:147,03466,434,09357,345,0001,039,0002,117,632stderr
6Jul 5, 2026 19:147,03866,503,10957,285,0001,135,0002,117,632stderr
7Jul 5, 2026 19:147,04166,482,09157,307,0001,135,0002,117,632stderr
8Jul 5, 2026 19:147,04766,519,89257,342,0001,151,0002,117,632stderr
9Jul 5, 2026 19:147,04866,665,18957,360,0001,143,0002,117,632stderr