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 listApr 14, 2025 12:16Yuriy LyfenkoYuriy LyfenkoScore: 59,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 12:1559,246543,731,33919,929,0001,992,0002,527,232
2Apr 14, 2025 12:1559,284545,813,35619,941,0001,994,0002,265,088
3Apr 14, 2025 12:1559,300546,434,93519,947,0001,994,0002,531,328
4Apr 14, 2025 12:1559,370544,937,89619,970,0001,997,0002,269,184
5Apr 14, 2025 12:1559,395546,142,01219,979,0001,997,0002,265,088
6Apr 14, 2025 12:1559,403549,863,85419,981,0001,998,0002,531,328
7Apr 14, 2025 12:1659,541544,232,46520,028,0002,002,0002,265,088
8Apr 14, 2025 12:1659,659540,800,92320,068,0002,006,0002,527,232
9Apr 14, 2025 12:1660,000548,377,25321,191,0001,009,0002,265,088