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 listJun 25, 2026 09:47Victor MerckléVictor MerckléScore: 57,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 09:4856,90228,838,44420,034,0001,020,0002,113,536
2Jun 25, 2026 09:4856,94528,530,01820,034,0001,036,0002,113,536
3Jun 25, 2026 09:4856,99428,993,99220,055,0001,033,0002,113,536
4Jun 25, 2026 09:4857,02128,904,26620,057,0001,041,0002,113,536
5Jun 25, 2026 09:4857,03728,980,61620,066,0001,038,0002,113,536
6Jun 25, 2026 09:4857,09728,580,43120,094,0001,032,0002,113,536
7Jun 25, 2026 09:4857,16728,601,51620,113,0001,039,0002,113,536
8Jun 25, 2026 09:4857,17229,037,29420,142,0001,012,0002,113,536
9Jun 25, 2026 09:48145,46461,883,10652,813,0001,009,0002,113,536