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 23, 2025 16:14Drew GarciaDrew GarciaScore: 588,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 16:14585,927241,274,855101,903,000114,890,0002,318,336
2Apr 23, 2025 16:14588,438245,219,726104,866,000112,856,0002,301,952
3Apr 23, 2025 16:14590,886245,775,030100,828,000117,800,0002,420,736