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 22, 2026 19:50Dominique GarmierDominique GarmierScore: 167,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 16:01163,6864,910,574,6124,865,494,00025,970,0002,408,448
2Mar 22, 2026 16:01163,9404,918,199,8504,878,197,00019,008,0002,859,008
3Mar 22, 2026 19:50167,2055,016,145,1404,973,958,00025,019,0002,498,560
4Mar 22, 2026 16:01167,5035,025,099,5054,978,314,00024,986,0002,654,208
5Mar 22, 2026 19:50167,6075,028,205,5444,973,424,00029,984,0002,662,400
6Mar 22, 2026 19:50168,1265,043,768,8084,996,101,00023,990,0002,400,256