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 30, 2026 14:00IlyaIlyaScore: 64,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 14:0163,91333,144,78922,509,0001,139,0002,113,536
2Jun 30, 2026 14:0164,12733,666,39322,525,0001,202,0002,113,536
3Jun 30, 2026 14:0164,15433,238,42922,537,0001,200,0002,113,536
4Jun 30, 2026 14:0164,18133,228,90722,540,0001,207,0002,113,536
5Jun 30, 2026 14:0164,18633,215,63922,627,0001,122,0002,113,536
6Jun 30, 2026 14:0164,22933,211,51922,655,0001,110,0002,113,536
7Jun 30, 2026 14:0164,23533,297,99822,574,0001,193,0002,113,536
8Jun 30, 2026 14:0164,26433,286,53122,660,0001,118,0002,113,536
9Jun 30, 2026 14:0164,38933,718,37422,709,0001,115,0002,113,536