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:04Franek KortaFranek KortaScore: 72,565Success
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:0471,79744,189,37025,544,0001,021,0002,441,216
2Apr 3, 2023 22:0471,94156,197,00726,618,00002,269,184
3Apr 3, 2023 22:0472,14953,173,20226,695,00002,531,328
4Apr 3, 2023 22:0472,17653,034,03826,705,00002,531,328
5Apr 3, 2023 22:0472,54653,823,66625,848,000994,0002,531,328
6Apr 3, 2023 22:0472,55757,266,26224,858,0001,988,0002,531,328
7Apr 3, 2023 22:0472,56554,683,44024,861,0001,988,0002,269,184
8Apr 3, 2023 22:0472,61156,103,29326,866,00002,269,184
9Apr 3, 2023 22:0472,67649,327,96225,895,000995,0002,449,408
10Apr 3, 2023 22:0476,64891,227,89928,359,80902,289,664
11Apr 3, 2023 22:0476,65496,556,39128,361,95802,170,880
12Apr 3, 2023 22:0476,66095,073,26928,364,32402,170,880