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 listApr 11, 2025 22:06Drew GarciaDrew GarciaScore: 104,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2025 22:06103,89264,861,98337,429,0001,011,0002,281,472
2Apr 11, 2025 22:06104,94168,027,88737,833,000995,0002,281,472
3Apr 11, 2025 22:06105,97068,309,63738,204,0001,005,0002,281,472