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 listMar 20, 2026 22:58Dominique GarmierDominique GarmierScore: 1,927,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 22:581,867,459712,131,843687,961,0002,999,0002,281,472
2Mar 20, 2026 23:261,923,573734,983,410709,723,0001,999,0002,363,392
3Mar 20, 2026 23:261,924,795761,813,747710,177,0001,997,0002,281,472
4Mar 20, 2026 23:261,927,122734,708,710712,035,0001,000,0002,359,296
5Mar 20, 2026 22:581,929,178748,721,638712,797,000999,0002,281,472
6Mar 20, 2026 22:581,930,681738,248,671712,354,0001,998,0002,285,568