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 16, 2026 21:05janwwwjanwwwScore: 63,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 21:0662,86733,750,36422,242,0001,019,0002,117,632
2Oct 16, 2026 21:0662,88333,758,60422,248,0001,019,0002,117,632
3Oct 16, 2026 21:0662,95433,886,64322,269,0001,024,0002,117,632
4Oct 16, 2026 21:0662,98933,841,41522,284,0001,022,0002,117,632
5Oct 16, 2026 21:0663,02735,392,56322,217,0001,103,0002,117,632
6Oct 16, 2026 21:0663,26233,982,08922,392,0001,015,0002,117,632
7Oct 16, 2026 21:0663,40233,988,80722,367,0001,092,0002,117,632
8Oct 16, 2026 21:0663,42134,023,77922,347,0001,119,0002,117,632
9Oct 16, 2026 21:0663,58334,170,36622,399,0001,127,0002,117,632