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 14:59Drew GarciaDrew GarciaScore: 77,005Success
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 14:5976,94351,580,44327,453,0001,016,0002,273,280
2Apr 20, 2025 14:5977,00560,252,57027,475,0001,017,0002,277,376
3Apr 20, 2025 14:5977,95955,201,46126,856,0001,989,0002,281,472