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 17, 2025 15:29Ashish AhujaAshish AhujaScore: 14,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2025 15:2914,018144,566,677109,326,0007,020,0002,334,720
2Aug 17, 2025 15:2714,162148,056,896110,570,0006,972,0002,338,816
3Aug 17, 2025 15:2714,210141,139,094110,951,0006,996,0002,506,752
4Aug 17, 2025 15:2914,215142,092,417110,987,0006,999,0002,338,816
5Aug 17, 2025 15:2714,299143,867,512111,700,0006,981,0002,334,720
6Aug 17, 2025 15:2914,433149,928,109111,808,0007,986,0002,506,752