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 listFeb 27, 2026 13:40Genos0Genos0Score: 71,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 13:4071,240614,909,868531,259,00060,029,0002,383,872
2Feb 27, 2026 13:4071,240615,634,812535,268,00056,028,0002,375,680
3Feb 27, 2026 13:4071,240618,988,459533,264,00058,028,0002,277,376
4Feb 27, 2026 13:4071,242617,521,817532,276,00059,030,0002,277,376
5Feb 27, 2026 13:4071,270618,994,510538,581,00052,958,0002,277,376
6Feb 27, 2026 13:4071,273619,818,867532,606,00058,956,0002,277,376
7Feb 27, 2026 13:4071,320613,350,611535,964,00055,996,0002,379,776
8Feb 27, 2026 13:4071,363619,145,337535,280,00057,029,0002,289,664
9Feb 27, 2026 13:4071,423618,956,220535,830,00056,982,0002,277,376