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 30, 2026 21:24IlyaIlyaScore: 62,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 21:2561,60232,222,85821,701,0001,092,0002,113,536
2Jun 30, 2026 21:2561,81832,391,36321,693,0001,180,0002,113,536
3Jun 30, 2026 21:2561,87532,465,80421,700,0001,194,0002,113,536
4Jun 30, 2026 21:2562,00032,437,57021,773,0001,167,0002,113,536
5Jun 30, 2026 21:2562,08632,956,67421,765,0001,207,0002,113,536
6Jun 30, 2026 21:2562,12132,470,75221,783,0001,202,0002,113,536
7Jun 30, 2026 21:2562,20532,978,63121,787,0001,229,0002,113,536
8Jun 30, 2026 21:2562,25932,526,51621,831,0001,205,0002,113,536
9Jun 30, 2026 21:2562,31032,833,30721,846,0001,209,0002,113,536