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 7, 2026 13:08IlyaIlyaScore: 59,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 13:0959,21831,539,19920,782,0001,129,0002,113,536
2Jul 7, 2026 13:0959,35431,612,85720,834,0001,127,0002,113,536
3Jul 7, 2026 13:0959,41332,197,43820,844,0001,139,0002,113,536
4Jul 7, 2026 13:0959,48131,685,12920,869,0001,139,0002,113,536
5Jul 7, 2026 13:0959,48631,791,39020,811,0001,199,0002,113,536
6Jul 7, 2026 13:0959,52731,623,26620,805,0001,220,0002,113,536
7Jul 7, 2026 13:0959,67831,837,67020,928,0001,153,0002,113,536
8Jul 7, 2026 13:0959,80531,751,37321,104,0001,024,0002,113,536
9Jul 7, 2026 13:0960,22431,957,96721,206,0001,077,0002,113,536