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 10, 2026 14:01Victor MerckléVictor MerckléScore: 63,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 14:0262,61330,771,23123,167,00002,113,536
2Jun 10, 2026 14:0262,90230,698,67123,274,00002,113,536
3Jun 10, 2026 14:0262,92430,953,89823,282,00002,113,536
4Jun 10, 2026 14:0263,07030,821,96723,336,00002,113,536
5Jun 10, 2026 14:0263,26231,020,81823,407,00002,113,536
6Jun 10, 2026 14:0263,29730,872,79023,420,00002,113,536
7Jun 10, 2026 14:0263,38131,402,87523,451,00002,113,536
8Jun 10, 2026 14:0263,76231,712,73023,592,00002,113,536
9Jun 10, 2026 14:02167,87569,800,11862,114,00002,113,536