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 18:42Pavel SkripkinPavel SkripkinScore: 17,631Success
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 18:4317,398583,641,350464,999,000109,156,0002,121,728stderr
2May 11, 2026 18:4317,554586,745,241464,480,000114,834,0002,121,728stderr
3May 11, 2026 18:4317,564587,070,465469,044,000110,584,0002,121,728stderr
4May 11, 2026 18:4317,627590,120,849464,382,000117,339,0002,121,728stderr
5May 11, 2026 18:4317,631590,632,559471,532,000110,313,0002,121,728stderr
6May 11, 2026 18:4317,748594,587,641472,810,000112,875,0002,121,728stderr
7May 11, 2026 18:4317,906598,484,160477,080,000113,849,0002,121,728stderr
8May 11, 2026 18:4317,991601,513,330479,236,000114,470,0002,121,728stderr
9May 11, 2026 18:4318,347613,585,305493,454,000112,001,0002,121,728stderr