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 18, 2025 18:59emily graceemily graceScore: 72,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 18:5972,22457,427,73025,734,000989,0002,273,280
2Apr 18, 2025 18:5972,54157,778,44925,846,000994,0002,289,664
3Apr 18, 2025 18:5972,61454,318,30225,872,000995,0002,277,376