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 14:07izotoffizotoffScore: 184,759Success
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 14:07184,46891,096,49866,246,0002,007,0002,326,528
2Nov 10, 2025 14:07184,75991,832,68366,351,0002,010,0002,531,328
3Nov 10, 2025 14:07185,41994,726,99267,597,0001,008,0002,326,528