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 listAug 18, 2025 13:06Ashish AhujaAshish AhujaScore: 11,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 13:0610,921116,080,82983,671,0006,972,0002,281,472
2Aug 18, 2025 13:0610,959116,161,03885,965,0004,997,0002,281,472
3Aug 18, 2025 13:0610,998117,948,91787,275,0004,012,0002,531,328
4Aug 18, 2025 13:0611,047121,679,08784,710,0006,976,0002,330,624
5Aug 18, 2025 13:0611,100115,861,46885,124,0007,010,0002,297,856
6Aug 18, 2025 13:0611,873126,592,99890,581,0007,963,0002,273,280