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:42Drew GarciaDrew GarciaScore: 74,711Success
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:4274,68953,679,24726,612,0001,023,0002,281,472
2Apr 20, 2025 15:4274,71159,114,70726,620,0001,023,0002,281,472
3Apr 20, 2025 15:4275,25755,282,71824,862,0002,983,0002,293,760