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 listMar 15, 2026 03:13limanjun99limanjun99Score: 14,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 03:1313,988486,347,592456,602,0004,995,0002,289,664
2Mar 15, 2026 03:1314,008488,496,174459,250,0003,001,0002,514,944
3Mar 15, 2026 03:1314,121485,757,874460,993,0004,999,0002,478,080
4Mar 15, 2026 03:1314,255493,179,307466,415,0003,994,0002,420,736
5Mar 15, 2026 03:1314,256492,815,391466,443,0003,995,0002,379,776
6Mar 15, 2026 03:1314,345498,069,406469,385,0003,994,0002,506,752
7Mar 15, 2026 03:1314,452509,577,873472,919,0003,999,0002,514,944
8Mar 15, 2026 03:1314,531501,769,181474,544,0004,995,0002,506,752
9Mar 15, 2026 03:1315,198527,102,598498,522,0002,997,0002,281,472