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 listJun 29, 2026 20:43IlyaIlyaScore: 59,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 20:4559,52131,489,65720,921,0001,102,0002,113,536
2Jun 29, 2026 20:4559,58131,923,71920,929,0001,116,0002,113,536
3Jun 29, 2026 20:4559,66731,499,60420,957,0001,120,0002,113,536
4Jun 29, 2026 20:4559,78931,565,31220,991,0001,131,0002,113,536
5Jun 29, 2026 20:4559,84832,203,28020,938,0001,206,0002,113,536
6Jun 29, 2026 20:4559,85631,640,02921,027,0001,120,0002,113,536
7Jun 29, 2026 20:4559,87037,128,57121,025,0001,127,0002,113,536
8Jun 29, 2026 20:4559,92132,080,14220,969,0001,202,0002,113,536
9Jun 29, 2026 20:4560,02131,885,78221,025,0001,183,0002,113,536