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 24, 2026 18:17Victor MerckléVictor MerckléScore: 77,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 18:1877,56237,859,10927,579,0001,119,0002,113,536
2Jun 24, 2026 18:1877,59737,844,11727,621,0001,090,0002,113,536
3Jun 24, 2026 18:1877,75137,889,30527,663,0001,105,0002,113,536
4Jun 24, 2026 18:1877,77237,857,05927,678,0001,098,0002,113,536
5Jun 24, 2026 18:1877,82937,955,27127,695,0001,102,0002,113,536
6Jun 24, 2026 18:1878,04037,987,26827,839,0001,036,0002,113,536
7Jun 24, 2026 18:1878,08638,008,92827,796,0001,096,0002,113,536
8Jun 24, 2026 18:1878,18138,083,63027,811,0001,116,0002,113,536
9Jun 24, 2026 18:1878,69439,881,04728,076,0001,041,0002,113,536