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 listJun 8, 2026 03:35anboto1anboto1Score: 5,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 03:365,954205,692,974184,721,00011,786,0002,117,632
2Jun 8, 2026 03:365,974206,453,998185,303,00011,844,0002,117,632
3Jun 8, 2026 03:365,990207,462,879185,721,00011,981,0002,117,632
4Jun 8, 2026 03:365,991206,927,204185,864,00011,855,0002,117,632
5Jun 8, 2026 03:365,993207,011,173185,817,00011,970,0002,117,632
6Jun 8, 2026 03:365,999207,299,981186,494,00011,477,0002,117,632
7Jun 8, 2026 03:366,006207,456,894186,169,00012,052,0002,117,632
8Jun 8, 2026 03:366,008207,488,996186,236,00012,038,0002,117,632
9Jun 8, 2026 03:366,008207,528,964186,339,00011,953,0002,117,632