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 6, 2025 14:17Rajarshi BasuRajarshi BasuScore: 6,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 14:176,34879,001,96350,665,0002,026,0002,289,664
2Dec 6, 2025 14:176,60479,812,29653,816,000996,0002,289,664
3Dec 6, 2025 14:176,68081,935,27053,428,0002,016,0002,289,664