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:38Chandrasekaran AkashChandrasekaran AkashScore: 64,916Success
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:3864,79251,370,45722,975,000998,0002,449,408
2Apr 18, 2025 00:3864,91653,967,52422,018,0002,001,0002,531,328
3Apr 18, 2025 00:3865,01947,236,58023,055,0001,002,0002,453,504