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 10, 2026 12:45Victor MerckléVictor MerckléScore: 62,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:4662,36430,469,66123,075,00002,113,536
2Jun 10, 2026 12:4662,40030,506,64623,088,00002,113,536
3Jun 10, 2026 12:4662,51330,576,64523,130,00002,113,536
4Jun 10, 2026 12:4662,71330,627,06223,204,00002,113,536
5Jun 10, 2026 12:4662,94530,903,76523,290,00002,113,536
6Jun 10, 2026 12:4662,99430,891,59023,308,00002,113,536
7Jun 10, 2026 12:4663,07831,051,80823,339,00002,113,536
8Jun 10, 2026 12:4663,36231,195,78723,444,00002,113,536
9Jun 10, 2026 12:4663,51830,932,91923,502,00002,113,536