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 20, 2025 15:08Drew GarciaDrew GarciaScore: 76,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2025 15:0876,17653,338,04127,179,0001,006,0002,269,184
2Apr 20, 2025 15:0876,72455,552,12226,361,0002,027,0002,281,472
3Apr 20, 2025 15:0877,48159,040,91626,621,0002,047,0002,281,472