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 12, 2025 04:13Drew GarciaDrew GarciaScore: 78,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2025 04:1377,98958,919,25126,866,0001,990,0002,277,376
2Apr 12, 2025 04:1378,21651,576,70024,949,0003,991,0002,281,472
3Apr 12, 2025 04:1378,24150,366,30325,955,0002,994,0002,404,352