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 listSep 21, 2025 08:45sheryllynn24sheryllynn24Score: 8,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2025 08:458,07995,550,35366,052,0001,000,0002,289,664
2Sep 21, 2025 08:458,09492,126,99965,179,0002,005,0002,519,040
3Sep 21, 2025 08:458,16795,014,98666,786,000996,0002,523,136
4Sep 21, 2025 08:458,48490,411,94469,411,0001,005,0002,289,664
5Sep 21, 2025 08:458,49997,113,58869,538,0001,007,0002,289,664
6Sep 21, 2025 08:458,530101,525,53669,798,000997,0002,289,664
7Sep 21, 2025 08:458,53595,768,92267,850,0002,993,0002,523,136
8Sep 21, 2025 08:458,536104,973,13369,851,000997,0002,289,664
9Sep 21, 2025 08:458,55397,898,74569,994,000999,0002,289,664
10Sep 21, 2025 08:458,56698,831,21769,092,0002,002,0002,527,232
11Sep 21, 2025 08:458,57095,665,40369,131,0002,003,0002,289,664
12Sep 21, 2025 08:459,287106,023,29075,083,0002,002,0002,514,944