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:02Franek KortaFranek KortaScore: 72,616Success
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:0271,77847,688,39626,558,00002,445,312
2Apr 3, 2023 22:0271,97348,195,39626,630,00002,445,312
3Apr 3, 2023 22:0272,01450,752,13726,645,00002,441,216
4Apr 3, 2023 22:0272,03250,652,29025,627,0001,025,0002,527,232
5Apr 3, 2023 22:0272,35749,830,78124,789,0001,983,0002,531,328
6Apr 3, 2023 22:0272,59556,760,22825,866,000994,0002,441,216
7Apr 3, 2023 22:0272,61653,960,10625,873,000995,0002,531,328
8Apr 3, 2023 22:0272,64951,366,16625,885,000995,0002,449,408
9Apr 3, 2023 22:0272,65160,404,79425,886,000995,0002,269,184
10Apr 3, 2023 22:0276,35084,276,20128,249,32602,289,664
11Apr 3, 2023 22:0276,48895,410,67628,300,56902,293,760
12Apr 3, 2023 22:0276,544104,607,77828,321,18302,297,856