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 18, 2025 12:53Ashish AhujaAshish AhujaScore: 11,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 12:5311,046122,118,02583,709,0007,972,0002,338,816
2Aug 18, 2025 12:5311,068113,799,04885,871,0005,991,0002,363,392
3Aug 18, 2025 12:5311,077122,870,05285,945,0005,996,0002,478,080
4Aug 18, 2025 12:5311,310121,255,85785,881,0007,989,0002,363,392
5Aug 18, 2025 12:5311,484124,190,78090,305,0005,016,0002,531,328
6Aug 18, 2025 12:5311,792125,090,00491,884,0005,992,0002,490,368