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 3, 2026 16:50Joshua MontrossJoshua MontrossScore: 46,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 16:5046,093392,472,911381,573,0001,001,0002,113,536
2Jul 3, 2026 16:5046,099392,017,728381,570,0001,055,0002,113,536
3Jul 3, 2026 16:5046,103392,560,192381,593,0001,068,0002,113,536
4Jul 3, 2026 16:5046,104392,087,173381,587,0001,077,0002,113,536
5Jul 3, 2026 16:5046,107392,122,665381,614,0001,077,0002,113,536
6Jul 3, 2026 16:5046,113392,169,825381,597,0001,143,0002,113,536
7Jul 3, 2026 16:5046,115392,231,221381,613,0001,149,0002,113,536
8Jul 3, 2026 16:5046,116392,205,047381,641,0001,122,0002,113,536
9Jul 3, 2026 16:5046,130392,305,334381,647,0001,236,0002,113,536