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 24, 2026 02:27Victor MerckléVictor MerckléScore: 3,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 02:283,492104,775,636282,828,0003,060,0002,654,208
2Jun 24, 2026 02:283,499104,979,502282,658,0003,066,0002,650,112
3Jun 24, 2026 02:283,509105,293,713283,991,0003,083,0002,654,208
4Jun 24, 2026 02:283,522105,667,118285,119,0003,152,0002,662,400
5Jun 24, 2026 02:283,531105,945,700285,746,0003,104,0002,654,208
6Jun 24, 2026 02:283,549106,484,977287,243,0003,113,0002,654,208
7Jun 24, 2026 02:283,554106,630,771291,288,0001,005,0002,654,208
8Jun 24, 2026 02:283,590107,711,912288,230,0002,055,0002,654,208
9Jun 24, 2026 02:283,611108,350,774286,786,0003,110,0002,654,208