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 17:39Charles CabergsCharles CabergsScore: 80,746Success
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 17:3979,94953,606,61528,561,0001,020,0002,510,848
2Apr 18, 2026 17:3980,14656,656,12729,654,00002,519,040
3Apr 18, 2026 17:3980,25959,912,39728,672,0001,024,0002,383,872
4Apr 18, 2026 17:3980,69257,605,59927,866,0001,990,0002,519,040
5Apr 18, 2026 17:3980,74662,656,28527,885,0001,991,0002,379,776
6Apr 18, 2026 17:3980,77656,052,74128,857,0001,030,0002,387,968
7Apr 18, 2026 17:3981,05457,149,77328,991,000999,0002,383,872
8Apr 18, 2026 17:3981,13056,808,98029,018,0001,000,0002,383,872
9Apr 18, 2026 17:3981,14664,396,56529,024,0001,000,0002,375,680