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:20Haha ExpertHaha ExpertScore: 91,370Success
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:2091,20843,183,32932,706,0001,041,0002,117,632
2Sep 12, 2026 09:2091,23242,530,46332,731,0001,025,0002,117,632
3Sep 12, 2026 09:2091,26742,494,96132,734,0001,035,0002,117,632
4Sep 12, 2026 09:2091,33543,276,50532,766,0001,028,0002,117,632
5Sep 12, 2026 09:2091,37043,207,28832,761,0001,046,0002,117,632
6Sep 12, 2026 09:2091,75642,640,04732,904,0001,046,0002,117,632
7Sep 12, 2026 09:2092,13243,580,63633,060,0001,029,0002,117,632
8Sep 12, 2026 09:2092,15142,778,48433,064,0001,032,0002,117,632
9Sep 12, 2026 09:2092,19143,510,56033,084,0001,027,0002,117,632