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 19:08Victor MerckléVictor MerckléScore: 16,613Success
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 19:0916,354490,644,113431,926,00044,888,0002,600,960
2Apr 28, 2026 19:0916,510495,314,270431,925,00045,885,0002,551,808
3Apr 28, 2026 19:0916,523495,713,117436,272,00044,925,0002,555,904
4Apr 28, 2026 19:0916,577497,321,279431,969,00042,798,0002,629,632
5Apr 28, 2026 19:0916,613498,409,395433,048,00046,896,0002,789,376
6Apr 28, 2026 19:0916,625498,766,434436,086,00042,910,0002,367,488
7Apr 28, 2026 19:0916,694500,847,597435,658,00043,965,0002,592,768
8Apr 28, 2026 19:0916,719501,597,149434,917,00044,888,0002,367,488
9Apr 28, 2026 19:0916,822504,686,963436,949,00044,892,0002,449,408