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 13, 2026 16:42Pavel SkripkinPavel SkripkinScore: 13,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 16:4312,875432,490,592421,846,0003,050,0002,117,632
2May 13, 2026 16:4313,311449,463,204436,226,0003,054,0002,117,632
3May 13, 2026 16:4313,321450,275,743437,611,0002,008,0002,117,632
4May 13, 2026 16:4313,366451,410,815438,056,0003,033,0002,117,632
5May 13, 2026 16:4313,421452,513,714439,857,0003,046,0002,117,632
6May 13, 2026 16:4313,867465,077,008454,513,0003,111,0002,117,632
7May 13, 2026 16:4314,100472,784,005462,300,0003,024,0002,117,632
8May 13, 2026 16:4314,183477,474,284464,977,0003,084,0002,117,632
9May 13, 2026 16:4315,191508,654,693499,306,0002,011,0002,117,632