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 listNov 25, 2025 09:36Ham-HamHam-HamScore: 51,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2025 09:3651,167446,561,041422,688,0001,998,0002,502,656
2Nov 25, 2025 09:3051,193450,244,039422,901,0001,999,0002,527,232
3Nov 25, 2025 09:3651,208446,287,652424,028,0001,000,0002,494,464
4Nov 25, 2025 09:3651,210448,203,406424,042,0001,000,0002,273,280
5Nov 25, 2025 09:3651,221449,423,147424,138,0001,000,0002,494,464
6Nov 25, 2025 09:3051,286450,336,574423,672,0001,998,0002,535,424
7Nov 25, 2025 09:3651,303449,740,796423,815,0001,999,0002,273,280
8Nov 25, 2025 09:3651,313450,220,232424,897,000999,0002,490,368
9Nov 25, 2025 09:3651,314443,651,371423,905,0001,999,0002,486,272
10Nov 25, 2025 09:3651,334448,424,801425,072,0001,000,0002,490,368
11Nov 25, 2025 09:3051,340452,528,612425,125,0001,000,0002,531,328
12Nov 25, 2025 09:3651,349452,707,693425,196,0001,000,0002,490,368