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 26, 2025 18:06sheryllynn24sheryllynn24Score: 6,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 18:066,49480,581,05151,905,0001,996,0002,285,568
2Sep 26, 2025 18:066,50385,122,84852,975,000999,0002,285,568
3Sep 26, 2025 18:066,50578,156,15851,989,0001,999,0002,285,568
4Sep 26, 2025 18:066,50682,033,16152,000,0002,000,0002,269,184
5Sep 26, 2025 18:066,50981,024,22053,026,0001,000,0002,285,568
6Sep 26, 2025 18:066,51081,616,00052,033,0002,001,0002,285,568
7Sep 26, 2025 18:066,51681,189,33152,083,0002,003,0002,285,568
8Sep 26, 2025 18:066,52276,423,31552,127,0002,004,0002,265,088
9Sep 26, 2025 18:066,52986,165,11652,186,0002,007,0002,523,136
10Sep 26, 2025 18:066,62486,900,01352,983,0001,999,0002,285,568
11Sep 26, 2025 18:066,63880,879,21053,092,0002,003,0002,269,184
12Sep 26, 2025 18:066,64385,938,00554,138,0001,002,0002,285,568