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 listMar 12, 2026 13:35Sergey SerebryakovSergey SerebryakovScore: 7,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 13:357,67393,158,62962,676,0001,010,0002,433,024
2Mar 12, 2026 13:357,69388,849,31862,836,0001,013,0002,445,312
3Mar 12, 2026 13:357,75881,841,16663,383,0001,006,0002,449,408
4Mar 12, 2026 13:357,85688,344,68763,198,0002,006,0002,437,120
5Mar 12, 2026 13:357,86788,227,50563,290,0002,009,0002,277,376
6Mar 12, 2026 13:357,88594,008,46464,443,0001,006,0002,449,408