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:51marko1597marko1597Score: 8,143Success
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:538,087242,638,387227,158,0007,294,0002,121,728stderr
2Aug 17, 2026 06:538,119243,596,924228,089,0007,308,0002,121,728stderr
3Aug 17, 2026 06:538,128243,855,210228,053,0007,469,0002,121,728stderr
4Aug 17, 2026 06:538,131243,933,049228,418,0007,299,0002,121,728stderr
5Aug 17, 2026 06:538,143244,300,577228,785,0007,304,0002,121,728stderr
6Aug 17, 2026 06:538,145244,355,248228,638,0007,332,0002,121,728stderr
7Aug 17, 2026 06:538,148244,457,747228,944,0007,312,0002,121,728stderr
8Aug 17, 2026 06:538,155244,654,410228,976,0007,374,0002,121,728stderr
9Aug 17, 2026 06:538,158244,754,896229,086,0007,301,0002,121,728stderr