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 listAug 17, 2026 23:21Josu San MartinJosu San MartinScore: 3,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 23:273,504125,484,231114,609,0001,027,0002,113,536
2Aug 17, 2026 23:273,509125,624,381114,798,0001,025,0002,113,536
3Aug 17, 2026 23:273,514125,871,788114,950,0001,022,0002,113,536
4Aug 17, 2026 23:273,522126,750,441115,208,0001,029,0002,113,536
5Aug 17, 2026 23:273,524126,264,918115,301,0001,022,0002,113,536
6Aug 17, 2026 23:273,524126,325,074115,274,0001,029,0002,113,536
7Aug 17, 2026 23:273,524126,210,247115,295,0001,025,0002,113,536
8Aug 17, 2026 23:273,527126,318,814115,390,0001,014,0002,113,536
9Aug 17, 2026 23:273,535126,420,673115,650,0001,022,0002,113,536