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 17:07Steve BronderSteve BronderScore: 70,835Success
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 17:0770,63850,143,66024,126,0002,010,0002,531,328
2Apr 21, 2025 17:0770,74152,469,89924,161,0002,013,0002,269,184
3Apr 21, 2025 17:0770,76557,420,95525,176,0001,007,0002,527,232
4Apr 21, 2025 17:0770,78149,560,73825,182,0001,007,0002,428,928
5Apr 21, 2025 17:0770,83547,855,89125,201,0001,008,0002,424,832
6Apr 21, 2025 17:0770,90548,918,39824,217,0002,018,0002,428,928
7Apr 21, 2025 17:0771,02455,427,16825,269,0001,010,0002,269,184
8Apr 21, 2025 17:0771,11949,302,92726,314,00002,433,024
9Apr 21, 2025 17:0771,13552,346,15226,320,00002,437,120