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 21:42Victor MerckléVictor MerckléScore: 71,664Success
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 21:4371,46235,519,68625,184,0001,257,0002,113,536
2Jun 24, 2026 21:4371,52435,575,08725,188,0001,276,0002,113,536
3Jun 24, 2026 21:4371,53235,588,88625,447,0001,020,0002,113,536
4Jun 24, 2026 21:4371,64535,647,72225,224,0001,285,0002,113,536
5Jun 24, 2026 21:4371,66435,651,23125,233,0001,283,0002,113,536
6Jun 24, 2026 21:4371,74035,712,58825,522,0001,022,0002,113,536
7Jun 24, 2026 21:4371,92935,775,65425,325,0001,289,0002,113,536
8Jun 24, 2026 21:4371,95135,714,93525,330,0001,292,0002,113,536
9Jun 24, 2026 21:4371,97835,748,78725,346,0001,286,0002,113,536