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 10:29Tomislav TunkovicTomislav TunkovicScore: 2,058Success
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 10:352,03360,998,025151,429,0002,058,00057,344
2Aug 17, 2026 10:352,04861,452,147153,173,0001,013,00057,344
3Aug 17, 2026 10:352,05461,638,026153,654,0001,058,00057,344
4Aug 17, 2026 10:352,05861,751,553154,059,0001,003,00057,344
5Aug 17, 2026 10:352,05861,750,802153,596,0001,061,00057,344
6Aug 17, 2026 10:352,06862,068,437153,744,0002,053,00057,344
7Aug 17, 2026 10:352,07062,119,295154,416,0001,022,00057,344
8Aug 17, 2026 10:352,07762,318,232155,217,0001,017,00057,344
9Aug 17, 2026 10:352,08562,562,231155,014,0002,074,00057,344