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 listMar 20, 2026 21:20Josu San MartinJosu San MartinScore: 64,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 21:2064,47648,843,53421,868,0001,988,0002,539,520
2Mar 20, 2026 21:2064,51450,433,60421,881,0001,989,0002,445,312
3Mar 20, 2026 21:2064,56249,206,75921,898,0001,990,0002,277,376
4Mar 20, 2026 21:2064,56854,338,47021,900,0001,990,0002,449,408
5Mar 20, 2026 21:2064,62446,336,19121,919,0001,992,0002,437,120
6Mar 20, 2026 21:2064,63050,802,09121,921,0001,992,0002,527,232
7Mar 20, 2026 21:2064,72249,848,58121,952,0001,995,0002,277,376
8Mar 20, 2026 21:2064,74647,086,80721,960,0001,996,0002,449,408
9Mar 20, 2026 21:2064,96258,539,73522,033,0002,003,0002,441,216