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 listApr 3, 2023 22:15Franek KortaFranek KortaScore: 73,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 22:1573,37852,079,13224,134,0003,016,0002,449,408
2Apr 3, 2023 22:1573,41150,804,74625,150,0002,012,0002,527,232
3Apr 3, 2023 22:1573,45453,309,28026,172,0001,006,0002,441,216
4Apr 3, 2023 22:1573,56554,058,32126,211,0001,008,0002,531,328
5Apr 3, 2023 22:1573,58949,688,25825,212,0002,016,0002,445,312
6Apr 3, 2023 22:1573,61451,458,31326,229,0001,008,0002,441,216
7Apr 3, 2023 22:1573,63549,350,36925,227,0002,018,0002,265,088
8Apr 3, 2023 22:1573,65747,022,71425,235,0002,018,0002,437,120
9Apr 3, 2023 22:1573,75148,608,60027,288,00002,531,328
10Apr 3, 2023 22:1575,36382,760,00827,884,22902,285,568
11Apr 3, 2023 22:1575,65592,830,69127,992,24202,289,664
12Apr 3, 2023 22:1575,83984,650,73528,060,53002,285,568