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 19, 2025 00:01emily graceemily graceScore: 69,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 00:0169,81156,009,79524,837,000993,0002,289,664
2Apr 19, 2025 00:0169,85150,871,36824,851,000994,0002,273,280
3Apr 19, 2025 00:0170,51149,986,73624,083,0002,006,0002,289,664