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:24Dominique GarmierDominique GarmierScore: 84,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 11:2479,2102,640,634,2122,608,931,0004,997,0002,285,568
2Mar 31, 2026 11:2484,1012,802,230,0532,767,322,0007,995,0002,289,664
3Mar 31, 2026 11:2484,2602,810,095,9702,776,572,0003,997,0002,289,664