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 9, 2023 21:23Franek KortaFranek KortaScore: 89,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 21:2387,34354,175,83131,308,0001,009,0002,523,136
2Apr 9, 2023 21:2387,42263,379,83632,346,00002,420,736
3Apr 9, 2023 21:2387,77054,495,98031,461,0001,014,0002,527,232
4Apr 9, 2023 21:2388,20055,427,87229,575,0003,059,0002,531,328
5Apr 9, 2023 21:2388,390115,657,20032,704,35602,269,184
6Apr 9, 2023 21:2388,43890,582,66832,721,97802,297,856
7Apr 9, 2023 21:2389,08156,400,78931,962,000998,0002,531,328
8Apr 9, 2023 21:2389,26795,319,13733,028,96102,170,880
9Apr 9, 2023 21:2389,64160,336,12731,157,0002,010,0002,424,832
10Apr 9, 2023 21:2390,97659,557,89432,641,0001,020,0002,265,088
11Apr 9, 2023 21:2392,23256,227,36033,123,0001,003,0002,428,928
12Apr 9, 2023 21:2392,30356,772,20933,148,0001,004,0002,437,120