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 00:40Chandrasekaran AkashChandrasekaran AkashScore: 64,943Success
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 00:4064,87042,514,30723,002,0001,000,0002,453,504
2Apr 18, 2025 00:4064,94352,925,05823,028,0001,001,0002,457,600
3Apr 18, 2025 00:4065,21447,913,91223,124,0001,005,0002,449,408