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 listJan 31, 2026 17:16olliecrowolliecrowScore: 20,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 17:1620,800721,473,853672,386,00014,008,0002,297,856
2Jan 31, 2026 17:1620,804712,180,243672,550,00013,990,0002,482,176
3Jan 31, 2026 17:1620,838712,158,951672,646,00014,992,0002,297,856
4Jan 31, 2026 17:1620,869720,231,494675,676,00012,993,0002,301,952
5Jan 31, 2026 17:1620,923718,106,374675,458,00014,987,0002,428,928
6Jan 31, 2026 17:1620,964719,977,489676,809,00014,995,0002,281,472
7Jan 31, 2026 17:1620,982725,273,963679,424,00012,988,0002,396,160
8Jan 31, 2026 17:1621,243727,876,148689,031,00011,983,0002,281,472
9Jan 31, 2026 17:1621,626746,562,111698,693,00014,972,0002,301,952