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 22:54olliecrowolliecrowScore: 63,518Success
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 22:5563,11039,968,62122,111,0001,240,0002,514,944
2May 4, 2026 22:5563,34539,379,66522,169,0001,269,0002,519,040
3May 4, 2026 22:5563,47540,955,04522,424,0001,062,0002,519,040
4May 4, 2026 22:5563,50542,071,65622,436,0001,061,0002,527,232
5May 4, 2026 22:5563,51841,622,26822,232,0001,270,0002,527,232
6May 4, 2026 22:5563,58342,404,75622,291,0001,235,0002,519,040
7May 4, 2026 22:5563,77241,163,37922,320,0001,276,0002,510,848
8May 4, 2026 22:5563,80838,184,59122,332,0001,277,0002,514,944
9May 4, 2026 22:5563,90842,885,48922,581,0001,065,0002,523,136