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 29, 2026 13:41TudyMTudyMScore: 11,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:4510,963328,915,623888,540,00033,020,0002,543,616
2Apr 29, 2026 13:4511,015330,468,690895,958,00021,998,0002,420,736
3Apr 29, 2026 13:4511,226336,786,912920,496,00031,982,0002,662,400
4Apr 29, 2026 13:4511,285338,579,014924,039,00027,970,0002,850,816
5Apr 29, 2026 13:4511,335340,065,147923,151,00028,973,0002,793,472
6Apr 29, 2026 13:4511,408342,263,887925,969,00025,971,0002,760,704
7Apr 29, 2026 13:4511,423342,699,504918,892,00031,961,0002,772,992
8Apr 29, 2026 13:4511,438343,145,307919,303,00030,976,0002,527,232
9Apr 29, 2026 13:4511,493344,801,004925,330,00026,980,0002,588,672