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 listMar 4, 2026 01:41olliecrowolliecrowScore: 10,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 01:4110,231306,917,813801,931,0006,999,0002,424,832
2Mar 4, 2026 01:4110,317309,507,994801,240,0004,995,0002,347,008
3Mar 4, 2026 01:4110,327309,823,640804,427,0004,990,0002,416,640
4Mar 4, 2026 01:4110,343310,282,547801,219,0004,995,0002,510,848
5Mar 4, 2026 01:4110,360310,814,539801,279,0006,002,0002,420,736
6Mar 4, 2026 01:4110,416312,484,929807,288,0005,987,0002,424,832
7Mar 4, 2026 01:4110,496314,888,301802,390,0006,985,0002,412,544
8Mar 4, 2026 01:4110,920327,603,264845,429,0005,981,0002,510,848
9Mar 4, 2026 01:4111,055331,645,118846,714,0003,993,0002,428,928