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 24, 2026 18:22Victor MerckléVictor MerckléScore: 77,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 18:2377,45137,726,80827,582,0001,075,0002,113,536
2Jun 24, 2026 18:2377,55137,880,02227,594,0001,100,0002,113,536
3Jun 24, 2026 18:2377,56237,790,71227,584,0001,114,0002,113,536
4Jun 24, 2026 18:2377,73537,823,75527,680,0001,082,0002,113,536
5Jun 24, 2026 18:2377,78337,889,56627,682,0001,098,0002,113,536
6Jun 24, 2026 18:2377,80837,955,76227,664,0001,125,0002,113,536
7Jun 24, 2026 18:2378,09438,066,20827,799,0001,096,0002,113,536
8Jun 24, 2026 18:2378,17238,052,28727,824,0001,100,0002,113,536
9Jun 24, 2026 18:2378,23538,043,69927,839,0001,108,0002,113,536