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 03:52Chandrasekaran AkashChandrasekaran AkashScore: 60,762Success
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 03:5259,94644,163,87420,164,0002,016,0002,441,216
2Apr 18, 2025 03:5260,45454,324,22522,368,00002,445,312
3Apr 18, 2025 03:5260,53845,883,26022,399,00002,445,312
4Apr 18, 2025 03:5260,56549,443,25521,391,0001,018,0002,441,216
5Apr 18, 2025 03:5260,76247,173,95122,482,00002,445,312
6Apr 18, 2025 03:5260,78950,182,51322,492,00002,531,328
7Apr 18, 2025 03:5260,80848,969,36222,499,00002,523,136
8Apr 18, 2025 03:5260,80849,770,04722,499,00002,445,312
9Apr 18, 2025 03:5260,85441,118,60122,516,00002,449,408