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 11, 2026 20:32Pavel SkripkinPavel SkripkinScore: 13,947Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:3312,449418,941,191408,829,0002,007,0002,117,632
2May 11, 2026 20:3312,975435,719,768426,192,0002,007,0002,117,632
3May 11, 2026 20:3313,358448,289,928438,835,0002,010,0002,117,632
4May 11, 2026 20:3313,855464,581,960455,217,0002,007,0002,117,632
5May 11, 2026 20:3313,947469,077,212457,210,0003,052,0002,117,632
6May 11, 2026 20:3314,130474,256,104464,308,0002,007,0002,117,632
7May 11, 2026 20:3314,374481,871,076472,348,0002,011,0002,117,632
8May 11, 2026 20:3314,489486,265,876476,151,0002,011,0002,117,632
9May 11, 2026 20:3314,814496,770,751486,862,0002,008,0002,117,632