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 24, 2026 19:30Victor MerckléVictor MerckléScore: 11,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 19:3111,373102,593,54893,294,0001,103,0002,113,536
2Jun 24, 2026 19:3111,379102,502,16793,350,0001,101,0002,113,536
3Jun 24, 2026 19:3111,380102,339,01193,359,0001,100,0002,113,536
4Jun 24, 2026 19:3111,385102,216,47893,404,0001,095,0002,113,536
5Jun 24, 2026 19:3111,386102,115,36493,409,0001,095,0002,113,536
6Jun 24, 2026 19:3111,391102,260,84593,451,0001,097,0002,113,536
7Jun 24, 2026 19:3111,395102,262,03093,477,0001,109,0002,113,536
8Jun 24, 2026 19:3111,422102,524,50493,723,0001,084,0002,113,536
9Jun 24, 2026 19:3111,750105,231,11896,450,0001,081,0002,113,536