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 20, 2026 00:24olliecrowolliecrowScore: 16,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 00:1916,051556,561,901520,694,0008,994,0002,301,952
2Mar 20, 2026 00:2416,062558,327,011521,043,0009,000,0002,281,472
3Mar 20, 2026 00:1916,070559,041,881522,307,0008,004,0002,482,176
4Mar 20, 2026 00:2416,264563,125,798527,710,0008,995,0002,281,472
5Mar 20, 2026 00:1916,388566,285,519530,796,0009,996,0002,281,472
6Mar 20, 2026 00:2417,219592,295,897532,278,00035,951,0002,281,472