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 09:27e1011e1011Score: 95,194Success
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 09:2983,44542,420,67729,681,0001,194,0002,113,536
2Oct 20, 2026 09:2983,84542,413,34929,835,0001,188,0002,113,536
3Oct 20, 2026 09:2994,72146,535,33033,844,0001,203,0002,113,536
4Oct 20, 2026 09:2995,07046,146,68233,991,0001,185,0002,113,536
5Oct 20, 2026 09:2995,19446,667,87933,938,0001,284,0002,113,536
6Oct 20, 2026 09:2995,46446,568,35534,123,0001,199,0002,113,536
7Oct 20, 2026 09:2995,52446,306,93134,135,0001,209,0002,113,536
8Oct 20, 2026 09:2995,63746,312,80034,261,0001,125,0002,113,536
9Oct 20, 2026 09:2995,72746,372,39334,296,0001,123,0002,113,536