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 01:09Chandrasekaran AkashChandrasekaran AkashScore: 61,984Success
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 01:0961,96251,144,89521,930,000996,0002,449,408
2Apr 18, 2025 01:0961,98446,714,70321,937,000997,0002,453,504
3Apr 18, 2025 01:0962,24149,586,00822,028,0001,001,0002,531,328