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 08:07M-RochatM-RochatScore: 18,898Success
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 08:0818,230613,294,683598,356,0003,242,0002,113,536
2May 17, 2026 08:0818,564623,106,625609,465,0003,161,0002,113,536
3May 17, 2026 08:0818,568622,798,383609,494,0003,254,0002,113,536
4May 17, 2026 08:0818,642624,386,888611,974,0003,228,0002,113,536
5May 17, 2026 08:0818,898633,475,113620,397,0003,252,0002,113,536
6May 17, 2026 08:0819,037637,708,767624,904,0003,347,0002,113,536
7May 17, 2026 08:0819,520653,669,030641,176,0003,010,0002,113,536
8May 17, 2026 08:0819,592657,288,612643,556,0003,011,0002,113,536
9May 17, 2026 08:0819,593655,651,661643,263,0003,326,0002,113,536