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 22, 2026 12:44BenBenScore: 17,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 12:4417,341520,238,6641,268,525,00070,973,0002,535,424
2Apr 22, 2026 12:4417,391521,735,7821,258,785,00075,987,0002,850,816
3Apr 22, 2026 12:4417,419522,584,1001,270,353,00070,074,0002,859,008
4Apr 22, 2026 12:4417,462523,880,7301,265,721,00063,985,0002,813,952
5Apr 22, 2026 12:4417,530525,904,4391,265,786,00064,886,0002,781,184
6Apr 22, 2026 12:4417,570527,108,3241,258,776,00073,694,0002,646,016
7Apr 22, 2026 12:4417,599527,988,9361,256,471,00071,912,0002,772,992
8Apr 22, 2026 12:4417,804534,126,7761,260,993,00070,887,0002,441,216
9Apr 22, 2026 12:4421,605648,170,1281,283,039,00060,389,0002,469,888