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:14Chandrasekaran AkashChandrasekaran AkashScore: 62,095Success
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:1461,85446,972,84520,896,0001,990,0002,269,184
2Apr 18, 2025 01:1461,87348,268,65920,903,0001,990,0002,445,312
3Apr 18, 2025 01:1461,96244,492,11521,930,000996,0002,531,328
4Apr 18, 2025 01:1462,00846,199,66421,946,000997,0002,531,328
5Apr 18, 2025 01:1462,09550,280,23121,977,000998,0002,269,184
6Apr 18, 2025 01:1462,14145,174,07721,993,000999,0002,449,408
7Apr 18, 2025 01:1462,14646,371,29521,995,000999,0002,531,328
8Apr 18, 2025 01:1462,36846,003,06322,073,0001,003,0002,449,408
9Apr 18, 2025 01:1462,41946,139,97522,091,0001,004,0002,453,504