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 16, 2025 17:00sheryllynn24sheryllynn24Score: 37,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2025 17:0035,418318,254,166290,971,0002,999,0002,277,376
2Sep 16, 2025 17:0035,485322,574,536292,526,0002,003,0002,285,568
3Sep 16, 2025 17:0037,645347,576,950310,448,0002,002,0002,379,776
4Sep 16, 2025 17:0037,674339,667,894310,696,0001,998,0002,441,216
5Sep 16, 2025 17:0037,675347,196,456310,706,0001,998,0002,277,376
6Sep 16, 2025 17:0037,691339,121,761310,840,0001,998,0002,285,568
7Sep 16, 2025 17:0037,733338,464,044310,181,0003,001,0002,379,776
8Sep 16, 2025 17:0037,758337,162,401311,386,0002,002,0002,285,568
9Sep 16, 2025 17:0037,761339,160,215311,411,0002,002,0002,281,472