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 07:29Victor MerckléVictor MerckléScore: 57,178Success
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 07:3056,97228,603,18620,059,0001,021,0002,113,536
2Jun 25, 2026 07:3057,02928,912,28320,074,0001,027,0002,113,536
3Jun 25, 2026 07:3057,04328,928,77820,100,0001,006,0002,113,536
4Jun 25, 2026 07:3057,06228,767,67020,081,0001,032,0002,113,536
5Jun 25, 2026 07:3057,17828,991,14620,121,0001,035,0002,113,536
6Jun 25, 2026 07:3057,20028,771,23120,138,0001,026,0002,113,536
7Jun 25, 2026 07:3057,22428,845,65920,171,0001,002,0002,113,536
8Jun 25, 2026 07:3057,24028,627,38520,166,0001,013,0002,113,536
9Jun 25, 2026 07:30144,52460,898,37052,457,0001,017,0002,113,536