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 6, 2026 20:22TonyTonyScore: 21,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 20:2221,448188,033,815176,882,0001,139,0002,113,536
2Aug 6, 2026 20:2221,460188,146,631176,887,0001,232,0002,113,536
3Aug 6, 2026 20:2221,461188,141,159176,906,0001,227,0002,113,536
4Aug 6, 2026 20:2221,472188,241,960177,216,0001,004,0002,113,536
5Aug 6, 2026 20:2221,499188,405,227177,262,0001,185,0002,113,536
6Aug 6, 2026 20:2221,524188,722,990177,500,0001,156,0002,113,536
7Aug 6, 2026 20:2221,528188,711,692177,521,0001,164,0002,113,536
8Aug 6, 2026 20:2221,531188,784,965177,708,0001,006,0002,113,536
9Aug 6, 2026 20:2221,546188,809,448177,752,0001,084,0002,113,536