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 14:14IlyaIlyaScore: 59,154Success
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 14:1858,77231,356,70320,650,0001,096,0002,113,536
2Jul 7, 2026 14:1858,97231,507,36920,714,0001,106,0002,113,536
3Jul 7, 2026 14:1859,00831,431,36820,725,0001,108,0002,113,536
4Jul 7, 2026 14:1859,13731,498,02020,715,0001,166,0002,113,536
5Jul 7, 2026 14:1859,15433,163,25020,721,0001,166,0002,113,536
6Jul 7, 2026 14:1859,19131,506,61620,757,0001,144,0002,113,536
7Jul 7, 2026 14:1859,22131,535,08520,883,0001,029,0002,113,536
8Jul 7, 2026 14:1859,27531,553,37820,719,0001,213,0002,113,536
9Jul 7, 2026 14:1859,35632,638,87420,832,0001,130,0002,113,536