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 2, 2026 11:56IlyaIlyaScore: 59,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 11:5759,40831,528,57620,851,0001,130,0002,113,536
2Jul 2, 2026 11:5759,58131,592,06320,854,0001,191,0002,113,536
3Jul 2, 2026 11:5759,59732,060,02520,819,0001,232,0002,113,536
4Jul 2, 2026 11:5759,64831,572,61820,865,0001,205,0002,113,536
5Jul 2, 2026 11:5759,70031,646,24320,911,0001,178,0002,113,536
6Jul 2, 2026 11:5759,77532,128,90120,877,0001,240,0002,113,536
7Jul 2, 2026 11:5759,87232,048,63620,933,0001,220,0002,113,536
8Jul 2, 2026 11:5759,93532,169,32520,965,0001,211,0002,113,536
9Jul 2, 2026 11:5759,94831,673,89420,967,0001,214,0002,113,536