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 listAug 17, 2026 06:22marko1597marko1597Score: 8,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 06:328,650259,518,905244,978,0006,283,0002,121,728stderr
2Aug 17, 2026 06:328,680260,425,193245,898,0006,374,0002,121,728stderr
3Aug 17, 2026 06:328,680260,424,377245,812,0006,192,0002,121,728stderr
4Aug 17, 2026 06:328,683260,502,418245,876,0006,357,0002,121,728stderr
5Aug 17, 2026 06:328,690260,714,317246,029,0006,343,0002,121,728stderr
6Aug 17, 2026 06:328,702261,068,840246,407,0006,306,0002,121,728stderr
7Aug 17, 2026 06:328,711261,337,419246,722,0006,204,0002,121,728stderr
8Aug 17, 2026 06:328,748262,462,476246,362,0006,357,0002,121,728stderr
9Aug 17, 2026 06:328,793263,812,938248,564,0006,365,0002,121,728stderr