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 21, 2026 22:37A_ShamanA_ShamanScore: 652,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 22:38650,875250,077,78657,238,000183,586,0002,113,536
2Jun 21, 2026 22:38651,189250,265,79157,249,000183,691,0002,113,536
3Jun 21, 2026 22:38652,940250,827,68857,251,000184,337,0002,113,536
4Jun 21, 2026 22:38652,962250,923,69957,271,000184,325,0002,113,536
5Jun 21, 2026 22:38652,970250,975,84157,378,000184,221,0002,113,536
6Jun 21, 2026 22:38653,594251,144,43757,330,000184,500,0002,113,536
7Jun 21, 2026 22:38654,886251,514,64657,257,000185,051,0002,113,536
8Jun 21, 2026 22:38658,181252,788,62657,325,000186,202,0002,113,536
9Jun 21, 2026 22:38662,356254,769,17257,289,000187,783,0002,113,536