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 listMay 13, 2026 00:16Josu San MartinJosu San MartinScore: 3,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 00:173,883138,945,665127,089,0001,065,0002,113,536
2May 13, 2026 00:173,883136,817,887127,062,0001,086,0002,113,536
3May 13, 2026 00:173,887137,967,353127,221,0001,060,0002,113,536
4May 13, 2026 00:173,888139,653,239127,210,0001,111,0002,113,536
5May 13, 2026 00:173,889139,209,084127,252,0001,111,0002,113,536
6May 13, 2026 00:173,892137,367,911127,319,0001,122,0002,113,536
7May 13, 2026 00:173,895139,058,131127,412,0001,138,0002,113,536
8May 13, 2026 00:173,896137,925,643127,456,0001,121,0002,113,536
9May 13, 2026 00:173,904137,693,015127,724,0001,116,0002,113,536