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 10, 2026 15:47Victor MerckléVictor MerckléScore: 6,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:476,22559,345,78650,635,0001,034,0002,113,536
2Jun 10, 2026 15:476,23559,306,87249,746,0002,009,0002,113,536
3Jun 10, 2026 15:476,23959,405,09550,769,0001,019,0002,113,536
4Jun 10, 2026 15:476,23959,342,87750,768,0001,020,0002,113,536
5Jun 10, 2026 15:476,24859,457,46250,834,0001,025,0002,113,536
6Jun 10, 2026 15:476,27759,682,73451,080,0001,020,0002,113,536
7Jun 10, 2026 15:476,28059,714,15650,080,0002,044,0002,113,536
8Jun 10, 2026 15:476,31059,962,80551,357,0001,018,0002,113,536
9Jun 10, 2026 15:476,34660,257,70351,652,0001,023,0002,113,536