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 00:55Chandrasekaran AkashChandrasekaran AkashScore: 62,211Success
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 00:5562,04145,139,04320,959,0001,996,0002,445,312
2Apr 18, 2025 00:5562,21155,115,25021,017,0002,001,0002,445,312
3Apr 18, 2025 00:5562,39544,702,05422,083,0001,003,0002,449,408