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 8, 2026 21:37IlyaIlyaScore: 58,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 21:3958,44831,279,37620,521,0001,105,0002,113,536
2Jul 8, 2026 21:3958,55431,345,22420,545,0001,120,0002,113,536
3Jul 8, 2026 21:3958,58631,333,07620,545,0001,132,0002,113,536
4Jul 8, 2026 21:3958,67531,313,23220,685,0001,025,0002,113,536
5Jul 8, 2026 21:3958,73231,415,36020,704,0001,027,0002,113,536
6Jul 8, 2026 21:3921,578,6917,995,338,2697,834,759,000149,357,0002,113,536
7Jul 8, 2026 21:3921,658,1598,023,455,6347,861,621,000151,898,0002,113,536
8Jul 8, 2026 21:3921,686,7108,034,266,7067,871,852,000152,231,0002,113,536
9Jul 8, 2026 21:3921,734,2438,051,512,9317,890,585,000151,085,0002,113,536