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 19, 2026 00:10Charles CabergsCharles CabergsScore: 75,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 00:1075,26256,198,37125,858,0001,989,0002,510,848
2Apr 19, 2026 00:1075,28160,388,08825,865,0001,989,0002,371,584
3Apr 19, 2026 00:1075,28953,136,93725,868,0001,989,0002,375,680
4Apr 19, 2026 00:1075,35453,323,30924,894,0002,987,0002,379,776
5Apr 19, 2026 00:1075,38958,334,83022,913,0004,981,0002,510,848
6Apr 19, 2026 00:1075,39555,903,75225,904,0001,992,0002,502,656
7Apr 19, 2026 00:1075,48656,369,91525,935,0001,995,0002,519,040
8Apr 19, 2026 00:1075,58458,156,26126,968,000998,0002,519,040
9Apr 19, 2026 00:1075,70355,138,57225,009,0003,001,0002,510,848