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 listSep 12, 2026 09:23Haha ExpertHaha ExpertScore: 80,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 09:2479,90838,975,02728,549,0001,017,0002,117,632
2Sep 12, 2026 09:2479,94538,197,21428,549,0001,031,0002,117,632
3Sep 12, 2026 09:2480,23738,469,28428,670,0001,018,0002,117,632
4Sep 12, 2026 09:2480,35638,445,49028,678,0001,054,0002,117,632
5Sep 12, 2026 09:2480,71039,356,30128,799,0001,064,0002,117,632
6Sep 12, 2026 09:2480,89138,917,90328,896,0001,034,0002,117,632
7Sep 12, 2026 09:2480,91638,700,27128,910,0001,029,0002,117,632
8Sep 12, 2026 09:2480,91838,627,39328,898,0001,042,0002,117,632
9Sep 12, 2026 09:2481,28138,948,82929,042,0001,032,0002,117,632