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 listJul 2, 2026 23:36A_ShamanA_ShamanScore: 70,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 23:3770,30035,627,39124,914,0001,097,0002,113,536
2Jul 2, 2026 23:3770,42135,568,66924,978,0001,078,0002,113,536
3Jul 2, 2026 23:3770,61836,068,99124,948,0001,181,0002,113,536
4Jul 2, 2026 23:3770,67535,689,00424,944,0001,206,0002,113,536
5Jul 2, 2026 23:3770,82136,201,68125,009,0001,195,0002,113,536
6Jul 2, 2026 23:3770,83235,765,28424,999,0001,209,0002,113,536
7Jul 2, 2026 23:3770,85935,823,07025,114,0001,104,0002,113,536
8Jul 2, 2026 23:3771,14836,300,07925,137,0001,188,0002,113,536
9Jul 2, 2026 23:3771,19736,292,67925,158,0001,185,0002,113,536