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 23:41emily graceemily graceScore: 72,486Success
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 23:4172,17850,733,59925,679,0001,027,0002,269,184
2Apr 18, 2025 23:4172,48655,160,98124,834,0001,986,0002,273,280
3Apr 18, 2025 23:4172,57657,626,38626,853,00002,277,376