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:18Chandrasekaran AkashChandrasekaran AkashScore: 61,957Success
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:1861,75154,267,14321,855,000993,0002,445,312
2Apr 18, 2025 01:1861,77046,091,52321,862,000993,0002,531,328
3Apr 18, 2025 01:1861,86249,255,15320,899,0001,990,0002,449,408
4Apr 18, 2025 01:1861,88944,660,04021,904,000995,0002,453,504
5Apr 18, 2025 01:1861,95752,400,39221,928,000996,0002,531,328
6Apr 18, 2025 01:1861,95745,168,97920,931,0001,993,0002,449,408
7Apr 18, 2025 01:1861,98944,181,60820,942,0001,994,0002,531,328
8Apr 18, 2025 01:1862,12247,907,29021,986,000999,0002,441,216
9Apr 18, 2025 01:1862,20846,541,74722,017,0001,000,0002,531,328