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 18, 2026 13:04Charles CabergsCharles CabergsScore: 90,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 13:0489,99757,922,08132,290,0001,009,0002,383,872
2Apr 18, 2026 13:0490,16558,372,02432,351,0001,010,0002,379,776
3Apr 18, 2026 13:0490,51457,702,28732,476,0001,014,0002,519,040
4Apr 18, 2026 13:0490,65758,922,48131,511,0002,032,0002,265,088
5Apr 18, 2026 13:0490,78661,735,08332,574,0001,017,0002,379,776
6Apr 18, 2026 13:0490,95168,633,47033,652,00002,387,968
7Apr 18, 2026 13:0491,49260,264,19032,857,000995,0002,383,872
8Apr 18, 2026 13:0491,67062,068,06531,923,0001,995,0002,519,040
9Apr 18, 2026 13:0491,76858,851,93832,956,000998,0002,510,848