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 listMar 3, 2026 22:27olliecrowolliecrowScore: 70,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 22:2770,24951,954,71325,992,00002,277,376
2Mar 3, 2026 22:2770,47347,344,33324,070,0002,005,0002,392,064
3Mar 3, 2026 22:2770,54350,182,28524,094,0002,007,0002,404,352
4Mar 3, 2026 22:2770,60852,878,14824,116,0002,009,0002,277,376
5Mar 3, 2026 22:2770,66250,880,78824,134,0002,011,0002,277,376
6Mar 3, 2026 22:2770,87848,156,67425,217,0001,008,0002,277,376
7Mar 3, 2026 22:2770,96854,341,16024,239,0002,019,0002,277,376
8Mar 3, 2026 22:2771,03253,086,76124,261,0002,021,0002,277,376
9Mar 3, 2026 22:2771,30554,187,38826,383,00002,400,256