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 listOct 31, 2026 00:23Andrew EpsteinAndrew EpsteinScore: 2,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 00:242,72099,301,11888,482,0001,286,0002,117,632
2Oct 31, 2026 00:242,72799,448,58588,980,0001,030,0002,117,632
3Oct 31, 2026 00:242,72899,461,17389,013,0001,018,0002,117,632
4Oct 31, 2026 00:242,73699,735,26289,037,0001,275,0002,117,632
5Oct 31, 2026 00:242,74199,893,13689,462,0001,007,0002,117,632
6Oct 31, 2026 00:242,745100,008,20189,586,0001,022,0002,117,632
7Oct 31, 2026 00:242,756100,431,50289,669,0001,291,0002,117,632
8Oct 31, 2026 00:242,757100,360,55189,980,0001,027,0002,117,632
9Oct 31, 2026 00:242,758100,523,65190,004,0001,027,0002,117,632