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 11, 2025 01:37Leon ZhaoLeon ZhaoScore: 11,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 01:3711,210117,518,47991,042,0002,000,0002,465,792
2Aug 11, 2025 01:3711,216117,155,22191,092,0002,002,0002,285,568
3Aug 11, 2025 01:3711,218117,687,71592,109,0001,001,0002,285,568
4Aug 11, 2025 01:3711,219122,719,68991,118,0002,002,0002,461,696
5Aug 11, 2025 01:3711,221118,965,69791,130,0002,002,0002,285,568
6Aug 11, 2025 01:3711,222121,684,56791,141,0002,003,0002,285,568
7Aug 11, 2025 01:3711,223117,480,09191,144,0002,003,0002,473,984
8Aug 11, 2025 01:3711,223117,767,17891,148,0002,003,0002,285,568
9Aug 11, 2025 01:3711,224120,271,35092,161,0001,001,0002,461,696
10Aug 11, 2025 01:3711,626123,632,37296,498,00002,469,888
11Aug 11, 2025 01:3711,630118,478,67796,530,00002,465,792
12Aug 11, 2025 01:3711,644124,792,48095,652,000996,0002,285,568