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 16, 2026 08:50M-RochatM-RochatScore: 23,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:5123,693792,976,637779,872,0002,003,0002,113,536
2May 16, 2026 08:5123,709793,195,539780,402,0002,006,0002,113,536
3May 16, 2026 08:5123,785795,510,597782,901,0002,005,0002,113,536
4May 16, 2026 08:5123,800797,645,075783,417,0002,002,0002,113,536
5May 16, 2026 08:5123,830796,341,641784,418,0002,003,0002,113,536
6May 16, 2026 08:5123,880797,213,527786,042,0002,004,0002,113,536
7May 16, 2026 08:5123,881799,717,027786,088,0002,005,0002,113,536
8May 16, 2026 08:5123,882798,453,372786,106,0002,003,0002,113,536
9May 16, 2026 08:5124,059805,622,917791,972,0002,005,0002,113,536