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 6, 2026 05:16Karthik ReddyKarthik ReddyScore: 2,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 05:172,73799,449,18989,334,0001,004,00020,480
2Oct 6, 2026 05:172,769100,402,28890,378,0001,026,00020,480
3Oct 6, 2026 05:172,780100,742,94190,742,0001,010,00020,480
4Oct 6, 2026 05:172,791101,183,48991,129,0001,004,00020,480
5Oct 6, 2026 05:172,795101,314,81091,231,0001,013,00020,480
6Oct 6, 2026 05:172,797101,403,03391,322,0001,004,00020,480
7Oct 6, 2026 05:172,800101,368,28391,388,0001,013,00020,480
8Oct 6, 2026 05:172,824102,301,53892,180,0001,016,00020,480
9Oct 6, 2026 05:172,872103,804,90393,797,0001,004,00020,480