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 16:22Victor MerckléVictor MerckléScore: 4,468Success
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 16:234,33143,450,91634,861,0001,093,0002,113,536
2Jun 25, 2026 16:234,33843,621,79734,908,0001,099,0002,113,536
3Jun 25, 2026 16:234,34843,622,72435,005,0001,086,0002,113,536
4Jun 25, 2026 16:234,36243,839,23135,120,0001,092,0002,113,536
5Jun 25, 2026 16:234,46844,541,85136,044,0001,045,0002,113,536
6Jun 25, 2026 16:234,50144,853,93536,247,0001,117,0002,113,536
7Jun 25, 2026 16:234,50944,979,42936,304,0001,123,0002,113,536
8Jun 25, 2026 16:234,51544,962,43436,386,0001,093,0002,113,536
9Jun 25, 2026 16:234,61745,913,40737,240,0001,088,0002,113,536