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 listJul 3, 2026 13:30IlyaIlyaScore: 59,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 13:3159,65631,600,75820,983,0001,090,0002,113,536
2Jul 3, 2026 13:3159,70031,569,76120,954,0001,135,0002,113,536
3Jul 3, 2026 13:3159,78632,013,68421,016,0001,105,0002,113,536
4Jul 3, 2026 13:3159,84831,610,44820,941,0001,203,0002,113,536
5Jul 3, 2026 13:3159,96432,186,85620,987,0001,200,0002,113,536
6Jul 3, 2026 13:3160,07831,726,76121,045,0001,184,0002,113,536
7Jul 3, 2026 13:3160,07831,751,41821,047,0001,182,0002,113,536
8Jul 3, 2026 13:3160,20032,306,30721,023,0001,251,0002,113,536
9Jul 3, 2026 13:3160,22132,332,42321,069,0001,213,0002,113,536