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 listOct 19, 2026 23:55e1011e1011Score: 92,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 23:5692,33744,987,97433,072,0001,093,0002,113,536
2Oct 19, 2026 23:5692,35945,033,88533,073,0001,100,0002,113,536
3Oct 19, 2026 23:5692,44845,111,37633,082,0001,124,0002,113,536
4Oct 19, 2026 23:5692,47045,087,64333,107,0001,107,0002,113,536
5Oct 19, 2026 23:5692,62945,450,87433,169,0001,104,0002,113,536
6Oct 19, 2026 23:5692,86745,280,71533,145,0001,216,0002,113,536
7Oct 19, 2026 23:5692,89745,239,64033,255,0001,117,0002,113,536
8Oct 19, 2026 23:5692,95946,664,85633,280,0001,115,0002,113,536
9Oct 19, 2026 23:5693,20045,333,96733,295,0001,189,0002,113,536