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 28, 2023 21:12Franek KortaFranek KortaScore: 76,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 21:1275,28155,051,62925,865,0001,989,0002,437,120
2Aug 28, 2023 21:1275,34956,450,64625,888,0001,991,0002,441,216
3Aug 28, 2023 21:1275,53049,412,36023,954,0003,992,0002,445,312
4Aug 28, 2023 21:1275,64354,620,27526,989,000999,0002,531,328
5Aug 28, 2023 21:1275,92250,986,68627,088,0001,003,0002,433,024
6Aug 28, 2023 21:1276,08454,248,57525,135,0003,016,0002,531,328
7Aug 28, 2023 21:1276,21651,079,69826,186,0002,014,0002,441,216
8Aug 28, 2023 21:1276,28952,029,00327,219,0001,008,0002,441,216
9Aug 28, 2023 21:1276,64954,746,03527,348,0001,012,0002,441,216
10Aug 28, 2023 21:1277,73194,961,89928,760,54502,289,664
11Aug 28, 2023 21:1277,84781,754,27528,803,46302,293,760
12Aug 28, 2023 21:1278,45892,150,40229,029,40402,281,472