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 30, 2026 16:14Charles CabergsCharles CabergsScore: 72,662Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 16:1572,55446,037,33724,857,0001,988,0002,355,200
2Apr 30, 2026 16:1572,59748,068,84323,877,0002,984,0002,371,584
3Apr 30, 2026 16:1572,61348,082,12022,887,0003,980,0002,359,296
4Apr 30, 2026 16:1572,62747,297,14124,882,0001,990,0002,363,392
5Apr 30, 2026 16:1572,66249,683,11323,898,0002,987,0002,359,296
6Apr 30, 2026 16:1572,68143,031,68224,900,0001,992,0002,359,296
7Apr 30, 2026 16:1572,71044,096,28523,914,0002,989,0002,359,296
8Apr 30, 2026 16:1572,75444,985,01623,928,0002,991,0002,351,104
9Apr 30, 2026 16:1572,81850,957,50624,948,0001,995,0002,355,200