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 17, 2026 13:40Kevin HeaveyKevin HeaveyScore: 3,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 13:463,66040,207,57229,361,0001,023,0002,113,536
2Jul 17, 2026 13:463,66540,269,08329,376,0001,048,0002,113,536
3Jul 17, 2026 13:463,66840,326,85329,401,0001,048,0002,113,536
4Jul 17, 2026 13:463,67440,426,31529,449,0001,046,0002,113,536
5Jul 17, 2026 13:463,71040,588,67929,601,0001,192,0002,113,536
6Jul 17, 2026 13:463,80441,398,80030,538,0001,043,0002,113,536
7Jul 17, 2026 13:463,83241,696,56030,764,0001,046,0002,113,536
8Jul 17, 2026 13:463,89942,239,73331,322,0001,044,0002,113,536
9Jul 17, 2026 13:463,91442,350,07931,451,0001,043,0002,113,536