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 8, 2026 23:27Victor MerckléVictor MerckléScore: 13,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:2812,208109,202,289100,231,0001,099,0002,117,632stderr
2Jul 8, 2026 23:2812,262109,653,974100,673,0001,108,0002,117,632stderr
3Jul 8, 2026 23:2812,356110,442,762101,518,0001,042,0002,117,632stderr
4Jul 8, 2026 23:2813,037116,216,185107,154,0001,060,0002,117,632stderr
5Jul 8, 2026 23:2813,068116,439,028107,449,0001,022,0002,117,632stderr
6Jul 8, 2026 23:2813,088116,828,236107,500,0001,132,0002,117,632stderr
7Jul 8, 2026 23:2813,095124,464,699107,554,0001,139,0002,117,632stderr
8Jul 8, 2026 23:2813,136116,955,262107,888,0001,141,0002,117,632stderr
9Jul 8, 2026 23:2813,329126,126,905109,635,0001,003,0002,117,632stderr