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 12, 2024 15:33Kirill AndriianovKirill AndriianovScore: 70,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 15:3370,117603,151,686581,967,00002,265,088
2Nov 12, 2024 15:3570,151606,068,588581,253,0001,000,0002,265,088
3Nov 12, 2024 15:3570,155611,094,423582,289,00002,269,184
4Nov 12, 2024 15:3370,157609,793,342582,300,00002,473,984
5Nov 12, 2024 15:3570,160605,822,707580,334,0001,997,0002,269,184
6Nov 12, 2024 15:3370,192605,564,352581,598,000999,0002,265,088