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 2, 2026 02:47Victor MerckléVictor MerckléScore: 4,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 02:494,21543,003,37533,884,0001,104,0002,117,632stderr
2Jul 2, 2026 02:494,21842,779,61633,894,0001,122,0002,117,632stderr
3Jul 2, 2026 02:494,23642,872,87834,127,0001,033,0002,117,632stderr
4Jul 2, 2026 02:494,24042,940,52434,106,0001,086,0002,117,632stderr
5Jul 2, 2026 02:494,24444,519,27034,142,0001,086,0002,117,632stderr
6Jul 2, 2026 02:494,24642,952,38734,150,0001,094,0002,117,632stderr
7Jul 2, 2026 02:494,24942,942,77334,261,0001,011,0002,117,632stderr
8Jul 2, 2026 02:494,25943,279,72034,331,0001,024,0002,117,632stderr
9Jul 2, 2026 02:494,27243,229,11634,335,0001,125,0002,117,632stderr