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 12, 2026 01:03Victor MerckléVictor MerckléScore: 65,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:0464,79434,423,91222,967,0001,007,0002,113,536
2May 12, 2026 01:0464,84035,527,53822,971,0001,020,0002,113,536
3May 12, 2026 01:0464,94833,582,58822,984,0001,047,0002,113,536
4May 12, 2026 01:0465,00833,380,81923,037,0001,016,0002,113,536
5May 12, 2026 01:0465,11034,931,11823,002,0001,089,0002,113,536
6May 12, 2026 01:0465,22433,768,40523,051,0001,082,0002,113,536
7May 12, 2026 01:0465,42133,284,87723,174,0001,032,0002,113,536
8May 12, 2026 01:0465,60535,849,58423,195,0001,079,0002,113,536
9May 12, 2026 01:0465,72933,764,45723,219,0001,101,0002,113,536