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 listJun 23, 2025 20:49Valentin KofmanValentin KofmanScore: 7,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 20:497,74186,004,20162,243,0002,007,0002,379,776
2Jun 23, 2025 20:497,75186,938,97062,321,0002,010,0002,281,472
3Jun 23, 2025 20:497,76887,459,30463,464,0001,007,0002,289,664
4Jun 23, 2025 20:497,77693,050,56964,540,00002,289,664
5Jun 23, 2025 20:497,79191,511,19564,664,00002,289,664
6Jun 23, 2025 20:497,81293,641,86962,848,0001,995,0002,265,088
7Jun 23, 2025 20:497,81887,941,83162,897,0001,996,0002,289,664
8Jun 23, 2025 20:497,89388,977,06264,504,0001,007,0002,379,776
9Jun 23, 2025 20:498,09588,721,63566,186,0001,002,0002,289,664
10Jun 23, 2025 20:4910,966115,588,32089,019,0002,000,0002,289,664
11Jun 23, 2025 20:4910,979113,383,28589,122,0002,002,0002,289,664
12Jun 23, 2025 20:4911,000118,807,08289,294,0002,006,0002,371,584