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 9, 2026 20:11Victor MerckléVictor MerckléScore: 23,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 20:1223,016199,141,835189,854,0001,187,0002,117,632stderr
2Jul 9, 2026 20:1223,033199,281,499190,157,0001,020,0002,117,632stderr
3Jul 9, 2026 20:1223,063199,544,334190,261,0001,162,0002,117,632stderr
4Jul 9, 2026 20:1223,078201,124,054190,430,0001,121,0002,117,632stderr
5Jul 9, 2026 20:1223,098199,831,284190,710,0001,011,0002,117,632stderr
6Jul 9, 2026 20:1223,158200,335,849191,037,0001,179,0002,117,632stderr
7Jul 9, 2026 20:1223,185200,569,466191,440,0001,003,0002,117,632stderr
8Jul 9, 2026 20:1223,192200,662,134191,451,0001,047,0002,117,632stderr
9Jul 9, 2026 20:1223,834205,962,656196,801,0001,022,0002,117,632stderr