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 28, 2026 10:20Victor MerckléVictor MerckléScore: 9,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 10:228,906267,190,586701,839,00014,975,0002,650,112
2Apr 28, 2026 10:228,972269,168,922698,507,00015,965,0002,650,112
3Apr 28, 2026 10:229,003270,108,292697,790,00014,995,0002,650,112
4Apr 28, 2026 10:229,054271,628,680702,441,00014,988,0002,613,248
5Apr 28, 2026 10:229,064271,922,075697,477,00017,986,0002,650,112
6Apr 28, 2026 10:229,080272,413,421700,750,00014,951,0002,355,200
7Apr 28, 2026 10:229,089272,698,526698,829,00016,971,0002,662,400
8Apr 28, 2026 10:229,100273,006,486701,363,00013,967,0002,641,920
9Apr 28, 2026 10:229,273278,195,780701,629,00013,972,0002,650,112