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 listAug 26, 2025 05:27Ashish AhujaAshish AhujaScore: 11,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 05:2710,991119,594,48271,394,00019,831,0002,506,752
2Aug 26, 2025 05:2711,112122,202,29880,328,00011,900,0002,506,752
3Aug 26, 2025 05:2711,182124,478,08375,846,00016,965,0002,506,752
4Aug 26, 2025 05:2711,264116,463,74974,593,00018,897,0002,502,656
5Aug 26, 2025 05:2711,325125,591,34773,000,00021,000,0002,404,352
6Aug 26, 2025 05:2711,497123,328,87475,548,00019,881,0002,351,104