Unique strings Sergey Svistunov

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 listMar 31, 2026 11:25Dominique GarmierDominique GarmierScore: 22,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 06:5022,896780,747,683746,569,0008,994,0002,342,912
2Mar 31, 2026 11:2522,937783,507,008750,911,0005,999,0002,416,640
3Mar 29, 2026 06:5022,986791,392,716749,542,0008,994,0002,424,832
4Mar 31, 2026 11:2522,994785,208,229750,797,0007,997,0002,461,696
5Mar 31, 2026 11:2523,001788,348,732752,039,0007,000,0002,514,944
6Mar 29, 2026 06:5023,033793,338,460756,088,0004,000,0002,363,392