Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listOct 31, 2026 09:23Andrew EpsteinAndrew EpsteinScore: 1,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 09:311,44943,498,97099,202,0001,189,0002,174,976stderr
2Oct 31, 2026 09:311,46143,838,299100,122,0001,196,0002,162,688stderr
3Oct 31, 2026 09:311,47644,293,928101,835,0001,159,0002,170,880stderr
4Oct 31, 2026 09:311,48644,581,190102,399,0001,098,0002,170,880stderr
5Oct 31, 2026 09:311,49144,744,261101,896,0001,107,0002,170,880stderr
6Oct 31, 2026 09:311,49344,796,101102,961,0001,162,0002,170,880stderr
7Oct 31, 2026 09:311,49544,878,945103,237,0001,080,0002,170,880stderr
8Oct 31, 2026 09:311,52445,731,234105,797,0001,205,0002,162,688stderr
9Oct 31, 2026 09:311,53546,059,158102,478,0001,158,0002,170,880stderr