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 listJan 13, 2025 04:50Ian MckibbenIan MckibbenScore: 408,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 04:50407,0023,404,443,9583,377,118,000999,0002,281,472
2Jan 13, 2025 04:50407,5683,411,414,6093,380,813,0001,998,0002,277,376
3Jan 13, 2025 04:50407,8343,415,363,2553,383,022,0001,998,0002,281,472
4Jan 13, 2025 04:50408,5043,419,675,7433,389,588,000999,0002,265,088
5Jan 13, 2025 04:50408,5153,417,199,1523,388,676,0001,998,0002,277,376
6Jan 13, 2025 04:50410,3133,429,402,6623,404,602,000999,0002,281,472