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 listMar 15, 2026 22:32Dominique GarmierDominique GarmierScore: 70,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:3270,85454,500,42824,200,0002,016,0002,273,280
2Mar 15, 2026 22:3270,88650,909,73825,220,0001,008,0002,400,256
3Mar 15, 2026 22:3271,20352,782,74924,319,0002,026,0002,273,280