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:46A_ShamanA_ShamanScore: 92,110Success
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:4791,47043,521,91732,799,0001,045,0002,113,536
2Jun 21, 2026 22:4792,01043,793,81533,021,0001,023,0002,113,536
3Jun 21, 2026 22:4792,01343,716,74433,017,0001,028,0002,113,536
4Jun 21, 2026 22:4792,06443,436,91133,016,0001,048,0002,113,536
5Jun 21, 2026 22:4792,11043,449,55133,051,0001,030,0002,113,536
6Jun 21, 2026 22:4792,41843,919,13133,150,0001,045,0002,113,536
7Jun 21, 2026 22:4792,97245,676,13033,357,0001,043,0002,113,536
8Jun 21, 2026 22:4793,02143,760,93633,376,0001,042,0002,113,536
9Jun 21, 2026 22:4793,30043,989,39233,497,0001,024,0002,113,536