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 20, 2025 08:08sheryllynn24sheryllynn24Score: 10,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 08:0810,656115,231,02588,447,00002,285,568
2Sep 20, 2025 08:0810,658115,175,98388,460,00002,285,568
3Sep 20, 2025 08:0810,662117,141,53786,484,0002,011,0002,523,136
4Sep 20, 2025 08:0810,667112,051,63387,533,0001,006,0002,285,568
5Sep 20, 2025 08:0810,670119,476,00987,554,0001,006,0002,285,568
6Sep 20, 2025 08:0810,671115,262,97287,563,0001,006,0002,265,088
7Sep 20, 2025 08:0810,671118,702,10587,567,0001,006,0002,285,568
8Sep 20, 2025 08:0810,711116,974,72987,901,000998,0002,285,568
9Sep 20, 2025 08:0810,775111,847,53489,436,00002,285,568
10Sep 20, 2025 08:0810,798117,618,75589,622,00002,285,568
11Sep 20, 2025 08:0810,833112,855,25087,916,0001,998,0002,519,040
12Sep 20, 2025 08:0810,841125,134,53087,982,0001,999,0002,523,136