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 22, 2026 08:41olliecrowolliecrowScore: 9,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 08:419,730341,862,016288,073,00033,008,0002,486,272
2Mar 22, 2026 08:389,743347,228,733281,579,00039,940,0002,306,048
3Mar 22, 2026 08:389,755342,830,395284,919,00036,989,0002,469,888
4Mar 22, 2026 08:419,769349,696,267271,475,00050,901,0002,306,048
5Mar 22, 2026 08:389,819348,498,350281,025,00043,003,0002,531,328
6Mar 22, 2026 08:4110,683384,170,399318,575,00033,954,0002,486,272