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:53olliecrowolliecrowScore: 9,701Success
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:539,683348,591,379275,596,00043,935,0002,494,464
2Mar 22, 2026 08:539,692341,731,276278,862,00040,979,0002,519,040
3Mar 22, 2026 08:539,693343,332,458268,893,00050,979,0002,494,464
4Mar 22, 2026 08:539,694341,331,368272,928,00046,987,0002,523,136
5Mar 22, 2026 08:539,701346,455,145283,127,00037,016,0002,420,736
6Mar 22, 2026 08:539,714341,136,248284,607,00035,950,0002,490,368
7Mar 22, 2026 08:539,721340,072,835275,813,00044,969,0002,420,736
8Mar 22, 2026 08:539,722342,000,626272,840,00047,971,0002,519,040
9Mar 22, 2026 08:539,730348,475,665280,086,00041,012,0002,412,544