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 18, 2025 19:10KeefeKeefeScore: 81,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 19:1080,92759,678,35227,947,0001,996,0002,260,992
2Apr 18, 2025 19:1081,18156,269,28028,035,0002,002,0002,396,160
3Apr 18, 2025 19:1081,27854,137,28728,069,0002,004,0002,400,256
4Apr 18, 2025 19:1081,30853,589,72129,082,0001,002,0002,269,184
5Apr 18, 2025 19:1081,31656,508,71328,082,0002,005,0002,396,160
6Apr 18, 2025 19:1081,34952,025,00328,093,0002,006,0002,404,352
7Apr 18, 2025 19:1081,37054,486,85429,104,0001,003,0002,269,184
8Apr 18, 2025 19:1081,37356,056,36628,101,0002,007,0002,404,352
9Apr 18, 2025 19:1081,51959,322,74227,146,0003,016,0002,269,184