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 listDec 4, 2025 13:12Rajarshi BasuRajarshi BasuScore: 9,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 13:129,05399,547,29574,137,0001,001,0002,457,600
2Dec 4, 2025 13:129,05695,740,43674,164,0001,002,0002,285,568
3Dec 4, 2025 13:129,139105,499,13273,858,0001,996,0002,289,664
4Dec 4, 2025 13:129,260107,436,23174,865,0001,996,0002,461,696
5Dec 4, 2025 13:129,403104,537,62176,040,0002,001,0002,457,600
6Dec 4, 2025 13:129,405100,995,65976,058,0002,001,0002,289,664