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 06:23Elijah KinElijah KinScore: 66,918Success
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 06:2466,78633,791,76723,591,0001,120,0002,113,536
2Jun 21, 2026 06:2466,88633,807,36023,644,0001,104,0002,113,536
3Jun 21, 2026 06:2466,90033,751,75923,630,0001,123,0002,113,536
4Jun 21, 2026 06:2466,91033,797,61023,645,0001,112,0002,113,536
5Jun 21, 2026 06:2466,91833,812,11523,741,0001,019,0002,113,536
6Jun 21, 2026 06:2467,31033,957,84623,795,0001,110,0002,113,536
7Jun 21, 2026 06:2467,32933,896,35323,802,0001,110,0002,113,536
8Jun 21, 2026 06:2467,33233,879,79323,797,0001,116,0002,113,536
9Jun 21, 2026 06:2467,48334,095,31623,830,0001,139,0002,113,536