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 00:44marko1597marko1597Error
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 03:100667,804,660656,917,0001,109,0002,121,728expected "1023624 ", got "0 "stderr
2Aug 17, 2026 03:100666,333,338655,437,0001,058,0002,121,728expected "1022685 ", got "0 "stderr
3Aug 17, 2026 03:100667,914,857656,984,0001,099,0002,121,728expected "1022284 ", got "0 "stderr