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:09izotoffizotoffScore: 216,989Success
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:09216,703106,571,99978,176,0002,004,0002,322,432
2Nov 10, 2025 14:09216,989107,883,22478,279,0002,007,0002,322,432
3Nov 10, 2025 14:09217,578103,049,72379,498,0001,006,0002,433,024