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 27, 2026 04:19Victor MerckléVictor MerckléScore: 5,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 04:195,57554,474,76045,141,0001,139,0002,134,016stderr
2Aug 27, 2026 04:195,59755,536,02345,260,0001,196,0002,134,016stderr
3Aug 27, 2026 04:195,61554,814,82745,435,0001,176,0002,134,016stderr
4Aug 27, 2026 04:195,63554,922,81945,745,0001,029,0002,134,016stderr
5Aug 27, 2026 04:195,63655,043,94645,641,0001,142,0002,134,016stderr
6Aug 27, 2026 04:195,64656,442,46845,650,0001,213,0002,134,016stderr
7Aug 27, 2026 04:195,65455,225,43745,766,0001,165,0002,134,016stderr
8Aug 27, 2026 04:195,66756,267,54445,767,0001,271,0002,134,016stderr
9Aug 27, 2026 04:195,87956,942,76347,764,0001,039,0002,134,016stderr