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 02:03Chandrasekaran AkashChandrasekaran AkashScore: 61,927Success
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 02:0361,78147,960,83121,866,000993,0002,445,312
2Apr 18, 2025 02:0361,92740,354,69521,917,000996,0002,531,328
3Apr 18, 2025 02:0362,48446,318,04522,114,0001,005,0002,531,328