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 18:48emily graceemily graceScore: 72,527Success
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 18:4871,66853,293,62525,498,0001,019,0002,392,064
2Apr 18, 2025 18:4872,52752,533,27925,842,000993,0002,281,472
3Apr 18, 2025 18:4872,59557,442,82424,871,0001,989,0002,269,184