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 28, 2026 09:49Shikhar SoniShikhar SoniScore: 72,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:5072,09736,201,13725,634,0001,042,0002,113,536
2Jun 28, 2026 09:5072,21636,186,63025,678,0001,042,0002,113,536
3Jun 28, 2026 09:5072,22136,200,22625,681,0001,041,0002,113,536
4Jun 28, 2026 09:5072,23236,216,60525,686,0001,040,0002,113,536
5Jun 28, 2026 09:5072,34536,644,42725,724,0001,044,0002,113,536
6Jun 28, 2026 09:5072,45936,651,59725,764,0001,046,0002,113,536
7Jun 28, 2026 09:5072,48136,263,41225,776,0001,042,0002,113,536
8Jun 28, 2026 09:5072,55436,318,92625,802,0001,043,0002,113,536
9Jun 28, 2026 09:5072,61637,974,09125,824,0001,044,0002,113,536