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 listSep 18, 2025 13:01sheryllynn24sheryllynn24Score: 16,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 18, 2025 13:0416,091162,634,675131,546,0002,008,0002,265,088
2Sep 18, 2025 13:0416,220158,026,678132,628,0001,994,0002,277,376
3Sep 18, 2025 13:0116,268165,555,070131,027,0004,000,0002,277,376
4Sep 18, 2025 13:0416,359165,727,098133,784,0001,996,0002,273,280
5Sep 18, 2025 13:0116,480166,018,525135,778,0001,005,0002,510,848
6Sep 18, 2025 13:0116,546166,909,050135,329,0002,004,0002,285,568