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 18, 2026 23:43Victor MerckléVictor MerckléScore: 63,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 23:4462,70530,648,87423,201,00002,113,536
2Jun 18, 2026 23:4462,89430,805,72123,271,00002,113,536
3Jun 18, 2026 23:4463,02930,857,97323,321,00002,113,536
4Jun 18, 2026 23:4463,38331,275,48423,452,00002,113,536
5Jun 18, 2026 23:4463,58130,987,03923,525,00002,113,536
6Jun 18, 2026 23:4463,60531,495,82423,534,00002,113,536
7Jun 18, 2026 23:4463,60831,843,02023,535,00002,113,536
8Jun 18, 2026 23:4463,90031,200,85023,643,00002,113,536
9Jun 18, 2026 23:4463,97833,032,54523,672,00002,113,536