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:02Chandrasekaran AkashChandrasekaran AkashScore: 61,930Success
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:0261,90847,362,41320,915,0001,991,0002,531,328
2Apr 18, 2025 02:0261,93051,057,79021,918,000996,0002,531,328
3Apr 18, 2025 02:0262,16852,122,88922,002,0001,000,0002,441,216