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 listJun 25, 2026 12:03Victor MerckléVictor MerckléScore: 4,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 12:044,36043,660,35135,070,0001,122,0002,113,536
2Jun 25, 2026 12:044,36043,667,56535,082,0001,109,0002,113,536
3Jun 25, 2026 12:044,37543,893,08835,215,0001,099,0002,113,536
4Jun 25, 2026 12:044,38043,929,90335,263,0001,094,0002,113,536
5Jun 25, 2026 12:044,38443,902,65335,289,0001,105,0002,113,536
6Jun 25, 2026 12:044,38544,016,36535,266,0001,131,0002,113,536
7Jun 25, 2026 12:044,41944,302,36635,661,0001,024,0002,113,536
8Jun 25, 2026 12:044,43344,564,92835,679,0001,119,0002,113,536
9Jun 25, 2026 12:044,50845,002,79136,318,0001,102,0002,113,536