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:11izotoffizotoffScore: 217,222Success
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:11216,859104,894,90377,230,0003,008,0002,433,024
2Nov 10, 2025 14:11217,222102,343,00480,372,00002,322,432
3Nov 10, 2025 14:11217,724105,457,39279,552,0001,006,0002,433,024