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 01:33zielajzielajScore: 3,025Success
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 01:332,974119,648,56096,151,0002,003,0002,535,424
2Jan 11, 2026 01:332,994129,171,49195,816,0002,994,0002,408,448
3Jan 11, 2026 01:333,009124,839,74697,283,0002,005,0002,416,640
4Jan 11, 2026 01:333,017129,733,02798,572,0001,005,0002,535,424
5Jan 11, 2026 01:333,025124,628,35196,832,0002,994,0002,535,424
6Jan 11, 2026 01:333,047125,224,70399,539,0001,005,0002,535,424
7Jan 11, 2026 01:333,055128,591,73697,814,0002,994,0002,412,544
8Jan 11, 2026 01:333,079131,680,755100,597,0001,005,0002,273,280
9Jan 11, 2026 01:333,117124,762,304100,855,0001,997,0002,273,280