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 listJan 12, 2026 10:39Pavel SkripkinPavel SkripkinScore: 99,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 10:3999,4073,308,943,5523,276,450,0003,996,0002,281,472
2Jan 12, 2026 10:3999,7183,313,805,8063,288,685,0001,998,0002,277,376
3Jan 12, 2026 10:39100,0743,322,961,0093,299,443,0002,999,0002,281,472