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 21:49Victor MerckléVictor MerckléScore: 5,586Success
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 21:505,56753,743,00445,085,0001,122,0002,113,536
2Jun 25, 2026 21:505,56853,790,09745,101,0001,114,0002,113,536
3Jun 25, 2026 21:505,57253,888,06945,180,0001,074,0002,113,536
4Jun 25, 2026 21:505,57653,887,93945,190,0001,099,0002,113,536
5Jun 25, 2026 21:505,58653,902,82545,265,0001,101,0002,113,536
6Jun 25, 2026 21:505,58954,001,15345,300,0001,093,0002,113,536
7Jun 25, 2026 21:505,59054,314,17345,311,0001,088,0002,113,536
8Jun 25, 2026 21:505,61154,062,32545,491,0001,084,0002,113,536
9Jun 25, 2026 21:505,62754,195,98345,627,0001,081,0002,113,536