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 22:43Victor MerckléVictor MerckléScore: 66,045Success
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 22:4465,72434,872,15223,199,0001,119,0002,113,536
2May 11, 2026 22:4465,88133,949,28023,359,0001,017,0002,113,536
3May 11, 2026 22:4465,89434,845,65723,189,0001,192,0002,113,536
4May 11, 2026 22:4466,03233,184,32923,237,0001,195,0002,113,536
5May 11, 2026 22:4466,04534,975,08623,412,0001,025,0002,113,536
6May 11, 2026 22:4466,13533,387,01923,455,0001,015,0002,113,536
7May 11, 2026 22:4466,15436,334,85723,354,0001,123,0002,113,536
8May 11, 2026 22:4466,35935,433,71323,322,0001,231,0002,113,536
9May 11, 2026 22:4466,44333,309,65723,571,0001,013,0002,113,536