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 listDec 15, 2023 12:08Dmitrii VasilevDmitrii VasilevScore: 73,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2023 12:0773,165664,954,547607,272,52302,260,992
2Dec 15, 2023 12:0773,193668,807,077607,503,73102,265,088
3Dec 15, 2023 12:0873,197674,862,235607,535,75502,252,800
4Dec 15, 2023 12:0873,213670,083,368607,666,53602,252,800
5Dec 15, 2023 12:0873,241665,117,145607,898,23402,265,088
6Dec 15, 2023 12:0773,243674,990,856607,920,13602,248,704