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 listMay 17, 2026 01:20M-RochatM-RochatScore: 21,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:2121,521719,134,797705,183,0005,033,0002,113,536
2May 17, 2026 01:2121,556720,261,835706,258,0005,107,0002,113,536
3May 17, 2026 01:2121,606722,784,873707,951,0005,059,0002,113,536
4May 17, 2026 01:2121,719725,879,726711,597,0005,152,0002,113,536
5May 17, 2026 01:2121,750728,062,057712,508,0005,269,0002,113,536
6May 17, 2026 01:2121,887732,897,430717,272,0005,019,0002,113,536
7May 17, 2026 01:2121,915733,263,098717,985,0005,233,0002,113,536
8May 17, 2026 01:2122,050736,499,743722,631,0005,019,0002,113,536
9May 17, 2026 01:2123,719791,616,234777,730,0005,026,0002,113,536