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 21, 2025 05:32Steve BronderSteve BronderScore: 70,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 05:3270,58149,644,01225,111,0001,004,0002,420,736
2Apr 21, 2025 05:3270,73547,960,76325,166,0001,006,0002,531,328
3Apr 21, 2025 05:3270,81949,118,74725,196,0001,007,0002,531,328
4Apr 21, 2025 05:3270,84944,702,54224,198,0002,016,0002,441,216
5Apr 21, 2025 05:3270,89254,228,71824,213,0002,017,0002,437,120
6Apr 21, 2025 05:3270,90549,697,97023,208,0003,027,0002,531,328
7Apr 21, 2025 05:3271,13049,060,61625,306,0001,012,0002,269,184
8Apr 21, 2025 05:3271,15748,853,11124,303,0002,025,0002,433,024
9Apr 21, 2025 05:3271,46547,532,47226,442,00002,437,120