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 listNov 10, 2025 18:52izotoffizotoffScore: 126,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 18:52125,95173,281,82345,589,0001,013,0002,396,160
2Nov 10, 2025 18:52126,78181,724,22045,911,000998,0002,297,856
3Nov 10, 2025 18:52126,78679,726,06143,917,0002,994,0002,297,856