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 listApr 23, 2026 18:15Charles CabergsCharles CabergsScore: 16,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 18:1615,532465,962,6611,322,666,00016,982,0002,985,984
2Apr 23, 2026 18:1615,662469,880,9911,340,708,0005,994,0002,711,552
3Apr 23, 2026 18:1615,901477,036,9891,339,729,00010,989,0002,781,184
4Apr 23, 2026 18:1616,136484,099,6311,371,220,00014,958,0002,957,312
5Apr 23, 2026 18:1616,257487,721,4761,387,598,00012,977,0002,777,088
6Apr 23, 2026 18:1616,286488,595,2841,390,220,00011,976,0002,969,600
7Apr 23, 2026 18:1616,441493,230,6181,388,414,00010,979,0002,965,504
8Apr 23, 2026 18:1616,485494,561,4781,406,164,00012,983,0002,752,512
9Apr 23, 2026 18:1616,544496,327,9151,410,394,00014,972,0002,732,032