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:11Chandrasekaran AkashChandrasekaran AkashScore: 62,062Success
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:1161,93248,538,07821,919,000996,0002,441,216
2Apr 18, 2025 02:1162,06246,943,59620,967,0001,996,0002,531,328
3Apr 18, 2025 02:1162,14946,014,71221,996,000999,0002,531,328