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 25, 2026 16:24Victor MerckléVictor MerckléScore: 10,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 16:2410,20493,061,04882,508,0002,193,0002,117,632stderr
2Aug 25, 2026 16:2410,23593,436,14782,653,0002,301,0002,117,632stderr
3Aug 25, 2026 16:2410,25093,454,42182,787,0002,291,0002,117,632stderr
4Aug 25, 2026 16:2410,29094,393,51983,130,0002,281,0002,117,632stderr
5Aug 25, 2026 16:2410,35894,446,74883,688,0002,287,0002,117,632stderr
6Aug 25, 2026 16:2410,47495,390,21684,635,0002,304,0002,117,632stderr
7Aug 25, 2026 16:2410,50596,272,96784,910,0002,287,0002,117,632stderr
8Aug 25, 2026 16:2410,63096,659,68785,975,0002,256,0002,117,632stderr
9Aug 25, 2026 16:2410,75697,655,45686,992,0002,286,0002,117,632stderr