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 11, 2026 02:46Sergey SerebryakovSergey SerebryakovScore: 74,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 02:4674,07053,826,63225,376,0002,030,0002,400,256
2Mar 11, 2026 02:4674,14955,314,32427,435,00002,396,160
3Mar 11, 2026 02:4674,27050,722,18526,463,0001,017,0002,396,160
4Mar 11, 2026 02:4674,28949,576,93827,487,00002,265,088
5Mar 11, 2026 02:4674,30049,428,94927,491,00002,400,256
6Mar 11, 2026 02:4674,35150,035,40024,454,0003,056,0002,392,064
7Mar 11, 2026 02:4674,38451,869,51026,503,0001,019,0002,519,040
8Mar 11, 2026 02:4674,40854,831,85426,512,0001,019,0002,265,088
9Mar 11, 2026 02:4674,82261,494,65027,684,00002,396,160