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 listMay 19, 2026 13:14Victor MerckléVictor MerckléScore: 5,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 13:155,94857,560,58948,350,0001,023,0002,113,536
2May 19, 2026 13:155,95358,490,33348,399,0001,015,0002,113,536
3May 19, 2026 13:155,95660,040,50248,407,0001,031,0002,113,536
4May 19, 2026 13:155,96057,102,25548,446,0001,025,0002,113,536
5May 19, 2026 13:155,99857,983,71048,768,0001,022,0002,113,536
6May 19, 2026 13:156,00957,709,06748,873,0001,009,0002,113,536
7May 19, 2026 13:156,11660,838,29649,735,0001,028,0002,113,536
8May 19, 2026 13:156,14060,234,57049,954,0001,008,0002,113,536
9May 19, 2026 13:156,14358,960,69949,967,0001,022,0002,113,536