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 18, 2025 23:46emily graceemily graceScore: 72,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 23:4671,90854,617,45626,606,00002,281,472
2Apr 18, 2025 23:4672,74158,158,80124,921,0001,993,0002,281,472
3Apr 18, 2025 23:4672,91149,984,38624,979,0001,998,0002,281,472