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 listJul 27, 2026 17:48Andrew TsibinAndrew TsibinScore: 9,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 17:499,063271,908,358223,815,00037,632,0002,117,632
2Jul 27, 2026 17:499,070272,100,126224,255,00037,592,0002,117,632
3Jul 27, 2026 17:499,356280,682,499233,051,00037,634,0002,117,632
4Jul 27, 2026 17:499,363280,892,954233,376,00037,572,0002,117,632
5Jul 27, 2026 17:499,379281,384,164233,750,00037,606,0002,117,632
6Jul 27, 2026 17:499,382281,465,479233,851,00037,670,0002,117,632
7Jul 27, 2026 17:499,402282,083,998233,003,00039,160,0002,117,632
8Jul 27, 2026 17:499,416282,490,675234,015,00038,625,0002,117,632
9Jul 27, 2026 17:499,476284,303,763234,730,00039,655,0002,117,632