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 18, 2026 01:51M-RochatM-RochatScore: 18,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:5318,288612,907,000600,521,0003,008,0002,113,536
2May 18, 2026 01:5318,321615,774,819600,573,0004,020,0002,113,536
3May 18, 2026 01:5318,334616,534,565601,017,0004,021,0002,113,536
4May 18, 2026 01:5318,378618,867,156602,417,0004,059,0002,113,536
5May 18, 2026 01:5318,657626,868,837611,644,0004,042,0002,113,536
6May 18, 2026 01:5318,673626,819,771612,111,0004,108,0002,113,536
7May 18, 2026 01:5319,659660,091,086644,718,0004,049,0002,113,536
8May 18, 2026 01:5319,745660,871,521647,577,0004,008,0002,113,536
9May 18, 2026 01:5319,774663,892,973648,484,0004,070,0002,113,536