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 9, 2026 13:45Alexander KrivolapovAlexander KrivolapovScore: 36,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 13:4536,0641,221,767,1331,056,337,000133,789,0002,281,472
2Mar 9, 2026 13:4536,3021,223,730,9631,050,208,000147,747,0002,400,256
3Mar 9, 2026 13:4536,4911,233,563,7791,079,392,000124,814,0002,437,120
4Mar 9, 2026 13:4536,6641,242,085,6101,069,151,000140,756,0002,441,216
5Mar 9, 2026 13:4536,8571,251,930,1211,073,496,000142,800,0002,457,600
6Mar 9, 2026 13:4536,9521,242,564,8931,066,616,000152,801,0002,453,504