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 01:14Chandrasekaran AkashChandrasekaran AkashScore: 62,335Success
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 01:1462,28942,884,76321,043,0002,004,0002,449,408
2Apr 18, 2025 01:1462,33546,898,48621,059,0002,005,0002,445,312
3Apr 18, 2025 01:1462,49746,250,99722,119,0001,005,0002,531,328