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 listFeb 24, 2025 16:37HighFreqBanditHighFreqBanditScore: 114,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2025 16:37113,906973,354,548943,425,0001,998,0002,281,472
2Feb 24, 2025 16:37113,991975,092,948944,127,0001,998,0002,289,664
3Feb 24, 2025 16:37114,249975,023,272946,272,0001,998,0002,289,664
4Feb 24, 2025 16:37114,258976,263,097947,343,000999,0002,265,088
5Feb 24, 2025 16:37114,305976,085,870947,733,000999,0002,281,472
6Feb 24, 2025 16:37114,323972,086,967946,881,0001,999,0002,273,280
7Feb 24, 2025 16:37114,551973,499,129948,771,0001,999,0002,289,664
8Feb 24, 2025 16:37114,569978,164,214948,923,0001,999,0002,523,136
9Feb 24, 2025 16:37114,646974,819,035950,559,000999,0002,273,280