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 21, 2026 15:32Charles CabergsCharles CabergsScore: 17,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 15:3317,006510,201,2821,460,129,00018,988,0002,781,184
2Apr 21, 2026 15:3317,031510,955,5321,457,828,00017,985,0002,940,928
3Apr 21, 2026 15:3317,047511,420,7031,458,642,00019,981,0002,994,176
4Apr 21, 2026 15:3317,166515,003,6201,459,154,00014,991,0002,887,680
5Apr 21, 2026 15:3317,168515,066,6501,462,240,00017,990,0002,969,600
6Apr 21, 2026 15:3317,228516,864,5541,461,314,00014,992,0002,846,720
7Apr 21, 2026 15:3317,266518,009,1571,461,252,00018,990,0002,936,832
8Apr 21, 2026 15:3317,667530,023,4631,507,000,00020,958,0002,580,480
9Apr 21, 2026 15:3317,668530,053,3471,506,244,00016,968,0002,953,216