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 7, 2026 02:15Victor MerckléVictor MerckléScore: 64,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 02:1563,92932,724,71822,531,0001,123,0002,113,536
2Jun 7, 2026 02:1563,94832,753,83022,527,0001,134,0002,113,536
3Jun 7, 2026 02:1564,02432,737,92222,534,0001,155,0002,113,536
4Jun 7, 2026 02:1564,10033,179,09522,578,0001,139,0002,113,536
5Jun 7, 2026 02:1564,10832,840,85722,573,0001,147,0002,113,536
6Jun 7, 2026 02:1564,17532,795,70522,611,0001,134,0002,113,536
7Jun 7, 2026 02:1564,30032,877,11022,728,0001,063,0002,113,536
8Jun 7, 2026 02:1564,39732,917,12022,731,0001,096,0002,113,536
9Jun 7, 2026 02:1564,51632,995,42022,728,0001,143,0002,113,536