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 26, 2026 21:09IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 21:11033,761,23322,838,0001,230,0002,113,536expected "429496526032 ", got "429496526097 "
2Jun 26, 2026 21:1164,56233,701,81222,677,0001,211,0002,113,536
3Jun 26, 2026 21:1164,65633,686,55322,714,0001,209,0002,113,536
4Jun 26, 2026 21:1164,69133,645,77322,712,0001,224,0002,113,536
5Jun 26, 2026 21:1164,72733,422,72822,750,0001,199,0002,113,536
6Jun 26, 2026 21:1164,75133,555,67422,725,0001,233,0002,113,536
7Jun 26, 2026 21:1164,86733,741,22422,755,0001,246,0002,113,536
8Jun 26, 2026 21:1165,00833,770,68822,829,0001,224,0002,113,536
9Jun 26, 2026 21:1165,12733,884,87022,866,0001,231,0002,113,536