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 21:37Victor MerckléVictor MerckléScore: 9,459Success
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 21:399,266277,994,445459,719,00063,684,0002,760,704
2Apr 28, 2026 21:399,324279,721,039452,775,00067,519,0002,969,600
3Apr 28, 2026 21:399,417282,514,074458,229,00063,615,0002,621,440
4Apr 28, 2026 21:399,425282,778,463454,466,00065,778,0002,695,168
5Apr 28, 2026 21:399,459283,793,413453,322,00066,752,0002,699,264
6Apr 28, 2026 21:399,470284,106,516459,012,00061,866,0002,785,280
7Apr 28, 2026 21:399,475284,253,676454,644,00064,523,0002,756,608
8Apr 28, 2026 21:399,496284,891,805457,652,00062,952,0002,699,264
9Apr 28, 2026 21:399,832294,974,797455,789,00063,691,0002,699,264