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 20, 2026 08:11e1011e1011Score: 95,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 08:1394,61645,904,91433,820,0001,188,0002,113,536
2Oct 20, 2026 08:1394,64546,439,06633,831,0001,188,0002,113,536
3Oct 20, 2026 08:1394,77846,083,73533,872,0001,196,0002,113,536
4Oct 20, 2026 08:1395,02145,988,69533,979,0001,179,0002,113,536
5Oct 20, 2026 08:1395,16446,654,54234,018,0001,193,0002,113,536
6Oct 20, 2026 08:1395,57546,166,77934,246,0001,117,0002,113,536
7Oct 20, 2026 08:1395,62146,274,85234,193,0001,187,0002,113,536
8Oct 20, 2026 08:1395,62446,364,59134,245,0001,136,0002,113,536
9Oct 20, 2026 08:1395,71846,324,07734,276,0001,140,0002,113,536