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 17, 2026 19:22Victor MerckléVictor MerckléScore: 4,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 19:234,51045,074,95936,370,0001,069,0002,113,536
2Jun 17, 2026 19:234,51745,123,69236,421,0001,077,0002,113,536
3Jun 17, 2026 19:234,52545,182,40236,492,0001,072,0002,113,536
4Jun 17, 2026 19:234,53045,023,45636,564,0001,041,0002,113,536
5Jun 17, 2026 19:234,54345,307,07236,663,0001,044,0002,113,536
6Jun 17, 2026 19:234,57345,905,36936,883,0001,080,0002,113,536
7Jun 17, 2026 19:234,71846,759,75138,102,0001,060,0002,113,536
8Jun 17, 2026 19:234,74146,928,20338,348,0001,004,0002,113,536
9Jun 17, 2026 19:234,75547,042,59638,465,0001,008,0002,113,536