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 02:50RyhbtRyhbtScore: 63,585Success
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 02:5163,565552,388,149525,593,0001,998,0002,523,136
2Aug 11, 2025 02:5163,577559,108,419524,695,0002,998,0002,527,232
3Aug 11, 2025 02:5163,581554,215,759526,727,000999,0002,527,232
4Aug 11, 2025 02:5163,582556,206,057525,735,0001,998,0002,523,136
5Aug 11, 2025 02:5163,585548,065,019526,753,000999,0002,523,136
6Aug 11, 2025 02:5063,586548,584,998526,765,000999,0002,527,232
7Aug 11, 2025 02:5063,593554,981,343526,823,000999,0002,527,232
8Aug 11, 2025 02:5063,597550,708,668525,854,0001,999,0002,527,232
9Aug 11, 2025 02:5163,606556,060,841526,929,000999,0002,433,024