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 listJul 7, 2026 19:08Victor MerckléVictor MerckléScore: 57,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 19:0957,24029,162,89521,179,00002,113,536
2Jul 7, 2026 19:0957,45629,126,79820,235,0001,024,0002,113,536
3Jul 7, 2026 19:0957,48329,034,50720,237,0001,032,0002,113,536
4Jul 7, 2026 19:0957,49129,079,58920,240,0001,032,0002,113,536
5Jul 7, 2026 19:0957,58329,355,01620,303,0001,003,0002,113,536
6Jul 7, 2026 19:0957,58629,146,41120,299,0001,008,0002,113,536
7Jul 7, 2026 19:0957,65629,221,54320,321,0001,012,0002,113,536
8Jul 7, 2026 19:0957,67029,160,00720,248,0001,090,0002,113,536
9Jul 7, 2026 19:09145,94064,380,63252,996,0001,002,0002,113,536