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 21, 2025 05:07Steve BronderSteve BronderScore: 72,835Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 05:0772,54152,654,30625,846,000994,0002,428,928
2Apr 21, 2025 05:0772,83554,162,11524,953,0001,996,0002,519,040
3Apr 21, 2025 05:0773,35754,180,59526,137,0001,005,0002,527,232