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 26, 2026 17:52TudyMTudyMScore: 225,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 17:53224,175104,111,70138,974,00043,971,0002,375,680
2Apr 26, 2026 17:53224,340102,765,90336,003,00047,003,0002,371,584
3Apr 26, 2026 17:53224,46296,836,71336,022,00047,029,0002,367,488
4Apr 26, 2026 17:53224,654100,176,83642,062,00041,060,0002,363,392
5Apr 26, 2026 17:53225,091104,236,46140,137,00043,147,0002,363,392
6Apr 26, 2026 17:53225,505101,830,31838,200,00045,237,0002,371,584
7Apr 26, 2026 17:53225,63796,229,83142,246,00041,240,0002,367,488
8Apr 26, 2026 17:53225,775100,140,76638,246,00045,291,0002,437,120
9Apr 26, 2026 17:53226,08699,071,82642,330,00041,322,0002,371,584