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 11, 2026 15:03Josu San MartinJosu San MartinScore: 4,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 15:034,723178,287,814151,861,0003,996,0002,289,664
2Jan 11, 2026 15:034,729187,784,017153,043,0003,000,0002,289,664
3Jan 11, 2026 15:034,734185,039,054155,232,0001,001,0002,404,352
4Jan 11, 2026 15:034,848188,735,853157,977,0001,999,0002,289,664
5Jan 11, 2026 15:034,849185,014,891157,002,0003,000,0002,289,664
6Jan 11, 2026 15:034,867192,076,027158,617,0001,995,0002,408,448