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 5, 2026 20:22olliecrowolliecrowScore: 14,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 20:2214,370501,233,064465,220,0009,004,0002,367,488
2Mar 5, 2026 20:2214,380499,949,061465,555,0008,991,0002,334,720
3Mar 5, 2026 20:2214,391497,752,646465,909,0008,998,0002,281,472
4Mar 5, 2026 20:2214,425501,893,059468,024,0008,000,0002,338,816
5Mar 5, 2026 20:2214,430505,723,338468,187,0008,003,0002,326,528
6Mar 5, 2026 20:2214,454505,162,737468,994,0007,999,0002,322,432
7Mar 5, 2026 20:2214,520502,634,649471,151,0008,002,0002,367,488
8Mar 5, 2026 20:2214,521510,458,567471,198,0008,003,0002,478,080
9Mar 5, 2026 20:2214,525510,699,134470,323,0009,006,0002,387,968