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 19:43emily graceemily graceScore: 72,595Success
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 19:4372,55950,962,39024,859,0001,988,0002,289,664
2Apr 18, 2025 19:4372,59551,319,90424,871,0001,989,0002,289,664
3Apr 18, 2025 19:4373,00048,070,25625,010,0002,000,0002,273,280