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 listOct 19, 2026 19:38e1011e1011Score: 22,298,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 19:3922,183,4168,219,478,4628,059,683,000148,181,0002,113,536
2Oct 19, 2026 19:3922,298,6008,261,601,4998,100,800,000149,682,0002,113,536
3Oct 19, 2026 19:3922,374,8488,290,680,9808,129,068,000149,626,0002,113,536