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 16:46Franek 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 9, 2023 16:4670,86248,337,86123,194,0003,025,0002,433,024
2Apr 9, 2023 16:4671,30347,216,15025,368,0001,014,0002,437,120
3Apr 9, 2023 16:4671,39751,109,75025,401,0001,016,0002,441,216
4Apr 9, 2023 16:4671,73046,156,29026,540,00002,269,184
5Apr 9, 2023 16:4671,76247,487,32425,531,0001,021,0002,437,120
6Apr 9, 2023 16:4672,53051,538,12322,861,0003,975,0002,265,088
7Apr 9, 2023 16:4672,61659,044,66225,873,000995,0002,269,184
8Apr 9, 2023 16:4673,35152,553,60326,135,0001,005,0002,441,216
9Apr 9, 2023 16:4673,74652,771,37226,276,0001,010,0002,531,328
10Apr 9, 2023 16:4677,30490,654,76628,602,65202,301,952
11Apr 9, 2023 16:4679,05490,494,59929,249,85102,301,952
12Apr 9, 2023 16:4679,369102,108,83829,366,66902,297,856