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 18, 2026 03:53Josu San MartinJosu San MartinScore: 4,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 04:044,748142,441,829198,011,0003,202,0002,158,592
2Aug 18, 2026 04:044,773143,214,067199,601,0003,188,0002,158,592
3Aug 18, 2026 04:044,774143,230,945199,081,0003,182,0002,158,592
4Aug 18, 2026 04:044,778143,343,672199,296,0003,222,0002,236,416
5Aug 18, 2026 04:044,788143,644,385199,548,0003,191,0002,158,592
6Aug 18, 2026 04:044,791143,737,972201,484,0003,215,0002,158,592
7Aug 18, 2026 04:044,887146,627,098200,585,0003,204,0002,158,592
8Aug 18, 2026 04:044,897146,923,395199,643,0003,211,0002,158,592
9Aug 18, 2026 04:044,905147,160,190200,436,0003,223,0002,158,592