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 listOct 19, 2024 12:56Alexis EngelkeAlexis EngelkeScore: 76,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2024 12:5674,74356,329,74426,631,0001,024,0002,297,856
2Oct 19, 2024 12:5676,07652,655,82027,143,0001,005,0002,363,392
3Oct 19, 2024 12:5676,48651,700,38227,290,0001,010,0002,363,392