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 2, 2026 16:08TonyTonyScore: 13,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 16:0913,185119,419,75580,732,00028,711,0002,113,536
2Aug 2, 2026 16:0913,240120,998,01781,048,00028,852,0002,113,536
3Aug 2, 2026 16:0913,287120,594,41981,546,00028,740,0002,113,536
4Aug 2, 2026 16:0913,316120,633,38681,311,00029,216,0002,113,536
5Aug 2, 2026 16:0913,316120,376,48781,719,00028,809,0002,113,536
6Aug 2, 2026 16:0913,332120,510,69981,719,00028,939,0002,113,536
7Aug 2, 2026 16:0913,353120,710,49081,931,00028,903,0002,113,536
8Aug 2, 2026 16:0913,378120,974,04081,868,00029,173,0002,113,536
9Aug 2, 2026 16:0913,642123,030,37284,502,00028,727,0002,113,536