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 18, 2026 15:09olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 18:39Andrew Epstein12.03CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 18:500307,146,058280,028,00016,330,0002,150,400expected "2107279 ", got "2074653 "
2Oct 15, 2026 18:5040012,003,52102,070,0002,158,592
3Oct 15, 2026 18:5052115,643,2331,861,0003,762,0002,154,496
4Apr 18, 2026 15:0913,067392,001,4651,054,375,00027,035,0002,461,696
5Apr 18, 2026 15:0913,219396,567,1841,046,583,00033,018,0002,777,088
6Apr 18, 2026 15:0914,367431,024,4331,141,628,00025,013,0002,641,920