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 listMar 15, 2026 03:20limanjun99limanjun99Score: 13,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 03:2013,440469,312,341438,537,0004,994,0002,506,752
2Mar 15, 2026 03:2013,501467,507,811442,551,0002,996,0002,289,664
3Mar 15, 2026 03:2013,511469,945,707441,873,0003,998,0002,383,872
4Mar 15, 2026 03:2013,563475,540,462443,577,0004,005,0002,297,856
5Mar 15, 2026 03:2013,725477,212,594450,917,0001,999,0002,371,584
6Mar 15, 2026 03:2013,748474,901,244449,675,0003,997,0002,519,040
7Mar 15, 2026 03:2013,858485,663,018453,308,0004,002,0002,330,624
8Mar 15, 2026 03:2014,098497,966,550462,238,0002,995,0002,445,312
9Mar 15, 2026 03:2014,350495,225,505468,555,0004,995,0002,273,280