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 listApr 1, 2026 18:49olliecrowolliecrowScore: 11,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 18:4810,947393,494,918319,225,00042,029,0002,437,120
2Apr 1, 2026 18:4910,974385,680,653318,127,00044,017,0002,535,424
3Apr 1, 2026 18:4810,980391,270,762315,298,00047,044,0002,441,216
4Apr 1, 2026 18:4911,027391,997,346322,889,00040,986,0002,441,216
5Apr 1, 2026 18:4811,033389,892,738306,079,00058,015,0002,551,808
6Apr 1, 2026 18:4911,790416,525,220337,071,00052,010,0002,445,312