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 listMay 17, 2026 11:52M-RochatM-RochatScore: 60,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 11:5360,15435,442,53521,250,0001,007,0002,113,536
2May 17, 2026 11:5360,19131,684,22521,260,0001,011,0002,113,536
3May 17, 2026 11:5360,22732,416,49421,239,0001,045,0002,113,536
4May 17, 2026 11:5360,26731,202,91621,290,0001,009,0002,113,536
5May 17, 2026 11:5360,27234,191,57421,284,0001,017,0002,113,536
6May 17, 2026 11:5360,36732,504,07621,320,0001,016,0002,113,536
7May 17, 2026 11:5360,37031,371,40221,321,0001,016,0002,113,536
8May 17, 2026 11:5360,38133,397,22021,331,0001,010,0002,113,536
9May 17, 2026 11:5360,39431,071,38121,326,0001,020,0002,113,536