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 5, 2026 20:40olliecrowolliecrowScore: 13,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 20:4113,810473,951,975449,509,0006,236,0002,560,000
2May 5, 2026 20:4113,810471,489,111449,577,0006,165,0002,564,096
3May 5, 2026 20:4113,844473,711,387450,699,0006,153,0002,310,144
4May 5, 2026 20:4113,844471,731,082450,711,0006,170,0002,310,144
5May 5, 2026 20:4113,877473,991,814451,757,0006,185,0002,314,240
6May 5, 2026 20:4113,880475,471,025451,762,0006,298,0002,310,144
7May 5, 2026 20:4113,935476,675,345453,864,0006,005,0002,306,048
8May 5, 2026 20:4114,024480,685,831456,710,0006,099,0002,301,952
9May 5, 2026 20:4115,173519,708,710494,598,0006,139,0002,564,096