Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 26, 2026 17:14Shikhar SoniShikhar SoniScore: 35,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 17:1535,3181,059,565,3531,037,664,00011,832,0002,129,920
2Jun 26, 2026 17:1535,3211,059,657,8021,038,337,00011,227,0002,129,920
3Jun 26, 2026 17:1535,3291,059,887,5511,038,091,00011,752,0002,129,920
4Jun 26, 2026 17:1535,3471,060,415,4531,040,071,00010,280,0002,129,920
5Jun 26, 2026 17:1535,3771,061,315,7671,038,820,00011,862,0002,129,920
6Jun 26, 2026 17:1535,3841,061,538,3431,039,103,00011,899,0002,129,920
7Jun 26, 2026 17:1535,4251,062,771,8611,041,317,00011,303,0002,129,920
8Jun 26, 2026 17:1535,4291,062,890,0461,042,598,00010,202,0002,129,920
9Jun 26, 2026 17:1535,5401,066,212,5201,044,561,00011,170,0002,129,920