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 listJun 25, 2026 22:04IlyaIlyaScore: 64,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 22:0564,53233,482,26622,668,0001,209,0002,113,536
2Jun 25, 2026 22:0564,57033,164,36422,690,0001,201,0002,113,536
3Jun 25, 2026 22:0564,65133,624,26222,685,0001,236,0002,113,536
4Jun 25, 2026 22:0564,67833,248,49222,703,0001,228,0002,113,536
5Jun 25, 2026 22:0564,70533,150,86922,796,0001,145,0002,113,536
6Jun 25, 2026 22:0564,74033,729,72822,718,0001,236,0002,113,536
7Jun 25, 2026 22:0564,76233,623,88522,701,0001,261,0002,113,536
8Jun 25, 2026 22:0564,94833,775,45622,820,0001,211,0002,113,536
9Jun 25, 2026 22:0565,04533,850,44122,833,0001,234,0002,113,536