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 listOct 20, 2026 07:45e1011e1011Score: 87,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 07:4685,52942,562,44430,540,0001,106,0002,113,536
2Oct 20, 2026 07:4685,95443,171,51430,604,0001,199,0002,113,536
3Oct 20, 2026 07:4686,70842,897,44930,983,0001,099,0002,113,536
4Oct 20, 2026 07:4687,61343,343,49731,304,0001,113,0002,113,536
5Oct 20, 2026 07:4687,82743,379,35631,399,0001,097,0002,113,536
6Oct 20, 2026 07:4688,09143,681,66731,370,0001,224,0002,113,536
7Oct 20, 2026 07:4688,70244,263,56331,631,0001,189,0002,113,536
8Oct 20, 2026 07:4689,11844,445,80231,766,0001,208,0002,113,536
9Oct 20, 2026 07:4689,36444,227,24731,845,0001,220,0002,113,536