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 22, 2026 03:00Elijah KinElijah KinScore: 73,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 03:0173,17836,138,83726,051,0001,025,0002,113,536
2Jun 22, 2026 03:0173,21636,082,27926,067,0001,023,0002,113,536
3Jun 22, 2026 03:0173,37536,227,06326,126,0001,023,0002,113,536
4Jun 22, 2026 03:0173,48936,202,16326,168,0001,023,0002,113,536
5Jun 22, 2026 03:0173,49436,230,11826,163,0001,030,0002,113,536
6Jun 22, 2026 03:0173,68136,288,46026,238,0001,024,0002,113,536
7Jun 22, 2026 03:0173,73536,318,30826,239,0001,043,0002,113,536
8Jun 22, 2026 03:0173,78936,396,62626,276,0001,026,0002,113,536
9Jun 22, 2026 03:0173,96736,436,81826,343,0001,025,0002,113,536