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:44Chandrasekaran AkashChandrasekaran AkashScore: 64,938Success
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:4464,68646,458,72121,940,0001,994,0002,445,312
2Apr 18, 2025 00:4464,93847,020,31623,026,0001,001,0002,531,328
3Apr 18, 2025 00:4464,98944,137,51722,043,0002,003,0002,445,312