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 4, 2026 23:31olliecrowolliecrowScore: 72,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:3271,63546,605,00025,300,0001,205,0002,523,136
2May 4, 2026 23:3271,65142,487,14825,286,0001,225,0002,519,040
3May 4, 2026 23:3271,87841,407,30925,368,0001,227,0002,514,944
4May 4, 2026 23:3272,05143,750,08625,424,0001,235,0002,523,136
5May 4, 2026 23:3272,11044,923,44025,435,0001,246,0002,514,944
6May 4, 2026 23:3272,13244,386,82125,456,0001,233,0002,523,136
7May 4, 2026 23:3272,15142,529,65725,466,0001,230,0002,514,944
8May 4, 2026 23:3272,37242,332,83725,535,0001,243,0002,527,232
9May 4, 2026 23:3272,48944,205,71025,557,0001,264,0002,519,040