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 listNov 21, 2025 00:39izotoffizotoffScore: 27,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 00:3926,289893,724,009863,540,0003,997,0002,527,232
2Nov 21, 2025 00:3926,516903,059,897870,017,0005,000,0002,334,720
3Nov 21, 2025 00:3926,546901,886,093874,028,0002,000,0002,392,064
4Nov 21, 2025 00:3926,885913,971,255883,198,0003,996,0002,400,256
5Nov 21, 2025 00:3927,058919,123,651887,925,0004,999,0002,367,488
6Nov 21, 2025 00:3927,567933,782,848905,710,0003,998,0002,396,160
7Nov 21, 2025 00:3927,739947,181,858909,401,0005,996,0002,498,560
8Nov 21, 2025 00:3930,0181,015,148,782982,587,0007,996,0002,408,448
9Nov 21, 2025 00:3930,7041,042,622,7861,008,248,0004,996,0002,502,656