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 14, 2025 06:15Chandrasekaran AkashChandrasekaran AkashScore: 62,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 06:1561,90845,674,96420,915,0001,991,0002,531,328
2Apr 14, 2025 06:1562,03844,956,40620,958,0001,996,0002,453,504
3Apr 14, 2025 06:1562,22744,901,51121,022,0002,002,0002,531,328