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:12Chandrasekaran AkashChandrasekaran AkashScore: 61,032Success
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:1260,65755,490,28321,423,0001,020,0002,449,408
2Apr 18, 2025 02:1261,03253,029,38921,556,0001,026,0002,531,328
3Apr 18, 2025 02:1261,06553,496,01522,594,00002,449,408