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:39Victor MerckléVictor MerckléScore: 6,418Success
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:416,171185,140,109433,360,00016,974,0002,732,032
2Apr 28, 2026 10:416,292188,772,430439,737,00019,942,0002,756,608
3Apr 28, 2026 10:416,390191,705,287446,826,00017,031,0002,732,032
4Apr 28, 2026 10:416,400192,025,755429,393,00017,974,0002,723,840
5Apr 28, 2026 10:416,418192,546,897446,377,00016,976,0002,756,608
6Apr 28, 2026 10:416,451193,540,821447,061,00020,002,0002,732,032
7Apr 28, 2026 10:416,481194,430,064439,954,00017,998,0002,580,480
8Apr 28, 2026 10:416,618198,568,522427,864,00017,994,0002,727,936
9Apr 28, 2026 10:416,889206,697,148438,681,00019,029,0002,781,184