TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listAug 29, 2023 20:33Franek KortaFranek KortaScore: 64,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2023 20:3364,53252,494,60622,883,000994,0002,531,328
2Aug 29, 2023 20:3364,54147,596,30822,885,000995,0002,445,312
3Aug 29, 2023 20:3364,55149,703,18922,889,000995,0002,437,120
4Aug 29, 2023 20:3364,57344,973,37821,901,0001,991,0002,531,328
5Aug 29, 2023 20:3364,62451,197,36522,915,000996,0002,437,120
6Aug 29, 2023 20:3364,64143,563,59822,921,000996,0002,433,024
7Aug 29, 2023 20:3364,81151,492,83221,982,0001,998,0002,441,216
8Aug 29, 2023 20:3364,91146,844,19722,016,0002,001,0002,437,120
9Aug 29, 2023 20:3364,97348,451,36923,039,0001,001,0002,441,216
10Aug 29, 2023 20:3369,19581,943,64125,602,03702,281,472
11Aug 29, 2023 20:3369,596104,672,30725,750,67502,199,552
12Aug 29, 2023 20:3369,81588,427,07725,831,49102,289,664