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 12, 2025 05:44Chandrasekaran AkashChandrasekaran AkashScore: 70,192Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2025 05:4469,97646,648,30624,856,0001,035,0002,531,328
2Apr 14, 2025 03:1970,14349,333,02323,957,0001,996,0002,441,216
3Apr 14, 2025 03:1970,16848,015,51124,964,000998,0002,441,216
4Apr 12, 2025 05:4470,19248,687,54023,974,0001,997,0002,531,328
5Apr 12, 2025 05:4470,21650,339,85123,982,0001,998,0002,531,328
6Apr 14, 2025 03:1970,41947,034,73424,051,0002,004,0002,445,312