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 19, 2026 15:30limanjun99limanjun99Score: 68,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 15:3068,06251,655,77123,169,0002,014,0002,289,664
2Mar 19, 2026 15:3068,08949,118,95024,186,0001,007,0002,281,472
3Mar 19, 2026 15:3068,11151,725,46224,193,0001,008,0002,269,184
4Mar 19, 2026 15:3068,20351,917,93423,217,0002,018,0002,265,088
5Mar 19, 2026 15:3068,27850,084,70023,242,0002,021,0002,273,280
6Mar 19, 2026 15:3068,29251,655,09424,258,0001,010,0002,281,472
7Mar 19, 2026 15:3068,85953,140,83024,459,0001,019,0002,289,664
8Mar 19, 2026 15:3069,13555,594,17523,613,0001,967,0002,289,664
9Mar 19, 2026 15:3069,14952,371,20224,562,0001,023,0002,289,664