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 listNov 5, 2026 17:21e1011e1011Score: 29,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 17:2229,705991,230,941947,934,00032,356,0002,113,536
2Nov 5, 2026 17:2229,709993,164,215947,896,00032,521,0002,113,536
3Nov 5, 2026 17:2229,742992,530,431949,849,00031,659,0002,113,536
4Nov 5, 2026 17:2229,756992,861,082950,623,00031,356,0002,113,536
5Nov 5, 2026 17:2229,762993,150,497949,832,00032,328,0002,113,536
6Nov 5, 2026 17:2229,813994,915,490951,958,00031,875,0002,113,536
7Nov 5, 2026 17:2229,815994,799,865951,168,00032,748,0002,113,536
8Nov 5, 2026 17:2229,867996,623,323952,671,00032,959,0002,113,536
9Nov 5, 2026 17:2229,948999,316,507955,749,00032,561,0002,113,536