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 listMay 11, 2026 20:13Victor MerckléVictor MerckléScore: 65,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:1465,02135,040,16523,030,0001,028,0002,113,536
2May 11, 2026 20:1465,02435,064,41323,039,0001,020,0002,113,536
3May 11, 2026 20:1465,13235,004,53723,078,0001,021,0002,113,536
4May 11, 2026 20:1465,32434,672,46323,058,0001,112,0002,113,536
5May 11, 2026 20:1465,33533,930,67123,101,0001,073,0002,113,536
6May 11, 2026 20:1465,34532,975,08223,107,0001,071,0002,113,536
7May 11, 2026 20:1465,47835,362,06523,221,0001,006,0002,113,536
8May 11, 2026 20:1465,55934,561,21623,227,0001,030,0002,113,536
9May 11, 2026 20:1465,68635,979,72323,213,0001,091,0002,113,536