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 15:43Shikhar SoniShikhar SoniScore: 60,582Success
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 15:4460,1631,804,892,8461,753,396,00040,672,0002,117,632
2Jun 26, 2026 15:4460,2821,808,468,1721,757,039,00040,632,0002,117,632
3Jun 26, 2026 15:4460,3161,809,506,9421,758,011,00040,929,0002,117,632
4Jun 26, 2026 15:4460,5271,815,835,8341,765,451,00039,876,0002,117,632
5Jun 26, 2026 15:4460,5821,817,487,3751,765,488,00039,818,0002,117,632
6Jun 26, 2026 15:4460,5991,817,994,7101,765,222,00041,969,0002,117,632
7Jun 26, 2026 15:4460,6211,818,637,8821,766,613,00039,693,0002,117,632
8Jun 26, 2026 15:4460,6411,819,246,3151,769,051,00039,349,0002,117,632
9Jun 26, 2026 15:4460,6891,820,699,4591,770,665,00039,666,0002,117,632