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 17, 2026 09:09Dominique GarmierDominique GarmierScore: 12,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 09:0612,290368,692,450982,371,00013,991,0002,760,704
2Mar 17, 2026 09:0612,444373,323,529994,883,00014,983,0002,752,512
3Mar 17, 2026 09:0912,512375,374,011998,087,00013,987,0002,654,208
4Mar 17, 2026 09:0912,536376,094,221988,707,00011,996,0003,014,656
5Mar 17, 2026 09:0612,620378,585,662992,998,00016,982,0002,752,512
6Mar 17, 2026 09:0912,672380,157,8371,001,867,00014,998,0002,707,456