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 17, 2026 01:14M-RochatM-RochatScore: 19,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:1819,625656,595,077643,547,0004,079,0002,113,536
2May 17, 2026 01:1819,631658,422,076644,364,0003,475,0002,113,536
3May 17, 2026 01:1819,830663,439,074648,365,0006,034,0002,113,536
4May 17, 2026 01:1819,915666,138,756653,190,0004,013,0002,113,536
5May 17, 2026 01:1819,998671,319,955656,466,0003,478,0002,113,536
6May 17, 2026 01:1820,004668,947,842656,080,0004,071,0002,113,536
7May 17, 2026 01:1821,792728,221,003715,153,0004,001,0002,113,536
8May 17, 2026 01:1821,856732,451,492718,250,0003,007,0002,113,536
9May 17, 2026 01:1821,861733,794,649718,437,0003,005,0002,113,536