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 24, 2026 20:11Victor MerckléVictor MerckléScore: 70,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 20:1270,18335,017,18424,699,0001,269,0002,113,536
2Jun 24, 2026 20:1270,27035,230,63324,979,0001,021,0002,113,536
3Jun 24, 2026 20:1270,31035,072,75824,997,0001,018,0002,113,536
4Jun 24, 2026 20:1270,39135,139,83225,024,0001,021,0002,113,536
5Jun 24, 2026 20:1270,42735,133,59724,769,0001,289,0002,113,536
6Jun 24, 2026 20:1270,47235,179,57025,053,0001,022,0002,113,536
7Jun 24, 2026 20:1270,63235,239,46425,112,0001,022,0002,113,536
8Jun 24, 2026 20:1270,63235,272,29725,113,0001,021,0002,113,536
9Jun 24, 2026 20:1270,64835,328,24225,119,0001,021,0002,113,536