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 11:53IlyaIlyaScore: 59,035Success
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 11:5458,79731,425,44220,651,0001,104,0002,113,536
2Jul 7, 2026 11:5458,86431,379,06520,672,0001,108,0002,113,536
3Jul 7, 2026 11:5458,98931,610,38120,706,0001,120,0002,113,536
4Jul 7, 2026 11:5459,02131,502,39020,736,0001,102,0002,113,536
5Jul 7, 2026 11:5459,03531,679,19420,724,0001,119,0002,113,536
6Jul 7, 2026 11:5459,22132,187,29220,694,0001,218,0002,113,536
7Jul 7, 2026 11:5459,37031,598,80520,767,0001,200,0002,113,536
8Jul 7, 2026 11:5459,37532,175,02020,724,0001,245,0002,113,536
9Jul 7, 2026 11:5459,40232,226,50220,759,0001,220,0002,113,536