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 23, 2026 11:25Dominique GarmierDominique GarmierScore: 70,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 11:2570,30042,357,00324,011,0002,000,0002,371,584
2Apr 23, 2026 11:2570,47042,897,87024,069,0002,005,0002,387,968
3Apr 23, 2026 11:2570,54544,176,67124,095,0002,007,0002,379,776
4Apr 23, 2026 11:2570,59443,609,56224,111,0002,009,0002,383,872
5Apr 23, 2026 11:2570,70241,598,00224,148,0002,012,0002,383,872
6Apr 23, 2026 11:2570,83545,510,46025,201,0001,008,0002,326,528
7Apr 23, 2026 11:2571,03247,454,23825,272,0001,010,0002,379,776
8Apr 23, 2026 11:2571,22445,523,49124,326,0002,027,0002,387,968
9Apr 23, 2026 11:2571,23547,656,09126,357,00002,383,872