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 27, 2025 07:14sheryllynn24sheryllynn24Score: 6,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 07:146,49181,651,53452,856,0001,016,0002,289,664
2Sep 27, 2025 07:146,49578,756,24351,909,0001,996,0002,265,088
3Sep 27, 2025 07:146,49879,871,81651,937,0001,997,0002,289,664
4Sep 27, 2025 07:146,51783,152,73052,084,0002,003,0002,523,136
5Sep 27, 2025 07:146,52879,521,94552,179,0002,006,0002,289,664
6Sep 27, 2025 07:146,55879,652,89453,424,0001,008,0002,523,136
7Sep 27, 2025 07:146,60780,329,79952,841,0001,994,0002,289,664
8Sep 27, 2025 07:146,61784,525,52652,923,0001,997,0002,265,088
9Sep 27, 2025 07:146,62179,819,90552,960,0001,998,0002,269,184
10Sep 27, 2025 07:146,62189,780,62952,959,0001,998,0002,289,664
11Sep 27, 2025 07:146,62784,486,30654,001,0001,000,0002,289,664
12Sep 27, 2025 07:146,63186,648,83855,041,00002,289,664