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 listAug 24, 2026 17:11Victor MerckléVictor MerckléScore: 3,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 17:133,87341,253,36330,979,0001,167,0002,117,632stderr
2Aug 24, 2026 17:133,88840,649,13531,142,0001,136,0002,117,632stderr
3Aug 24, 2026 17:133,88940,665,01531,185,0001,098,0002,117,632stderr
4Aug 24, 2026 17:133,89840,732,51131,079,0001,282,0002,117,632stderr
5Aug 24, 2026 17:133,90240,776,86931,355,0001,039,0002,117,632stderr
6Aug 24, 2026 17:133,90540,823,61631,247,0001,165,0002,117,632stderr
7Aug 24, 2026 17:133,92440,991,17131,551,0001,022,0002,117,632stderr
8Aug 24, 2026 17:134,00741,674,04732,091,0001,171,0002,117,632stderr
9Aug 24, 2026 17:134,07742,202,33632,719,0001,125,0002,117,632stderr