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 29, 2026 19:10Charles CabergsCharles CabergsScore: 72,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 19:1172,61647,086,43924,878,0001,990,0002,367,488
2Apr 29, 2026 19:1172,65946,278,95223,897,0002,987,0002,359,296
3Apr 29, 2026 19:1172,66242,556,18224,894,0001,991,0002,355,200
4Apr 29, 2026 19:1172,66244,568,44824,894,0001,991,0002,359,296
5Apr 29, 2026 19:1172,70046,239,23824,907,0001,992,0002,355,200
6Apr 29, 2026 19:1172,76246,258,84424,928,0001,994,0002,355,200
7Apr 29, 2026 19:1172,82143,027,63924,949,0001,995,0002,363,392
8Apr 29, 2026 19:1172,94045,652,57724,989,0001,999,0002,359,296
9Apr 29, 2026 19:1173,33747,606,38125,125,0002,010,0002,363,392