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 listJan 1, 2026 20:20zielajzielajScore: 3,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 23:533,461137,393,115111,211,0003,005,0002,412,544
2Jan 1, 2026 23:533,491139,615,822114,217,0001,001,0002,498,560
3Jan 1, 2026 23:523,521141,448,249115,176,0001,001,0002,273,280
4Jan 1, 2026 20:203,526139,880,928114,357,0002,006,0002,273,280
5Jan 1, 2026 23:523,539143,694,234115,785,000998,0002,416,640
6Jan 1, 2026 23:533,589148,430,918117,444,0001,003,0002,506,752
7Jan 1, 2026 23:523,687145,358,888118,691,0002,992,0002,273,280
8Jan 1, 2026 20:203,693147,093,592119,872,0001,997,0002,424,832
9Jan 1, 2026 20:203,699153,313,490120,078,0002,001,0002,535,424