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 22, 2026 06:16olliecrowolliecrowScore: 9,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 06:169,876355,725,690319,908,0005,998,0002,285,568
2Mar 22, 2026 06:169,887347,185,594326,264,00002,473,984
3Mar 22, 2026 06:169,907350,844,179324,942,0001,999,0002,277,376
4Mar 22, 2026 06:169,919350,573,643322,326,0005,005,0002,531,328
5Mar 22, 2026 06:169,927352,288,946323,589,0003,994,0002,482,176
6Mar 22, 2026 06:169,950355,308,317323,338,0005,005,0002,469,888
7Mar 22, 2026 06:169,978355,228,230324,259,0005,004,0002,469,888
8Mar 22, 2026 06:1610,015356,443,315324,497,0005,990,0002,478,080
9Mar 22, 2026 06:1610,917403,752,086356,270,0004,003,0002,338,816