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 22:05Victor MerckléVictor MerckléScore: 9,208Success
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 22:069,008270,260,831437,883,00064,687,0002,600,960
2Apr 28, 2026 22:069,124273,724,832439,059,00063,718,0002,883,584
3Apr 28, 2026 22:069,159274,775,124438,543,00064,491,0002,834,432
4Apr 28, 2026 22:069,199275,995,815437,364,00063,907,0002,822,144
5Apr 28, 2026 22:069,208276,262,989438,886,00063,837,0002,805,760
6Apr 28, 2026 22:069,256277,680,046442,527,00065,633,0002,826,240
7Apr 28, 2026 22:069,376281,291,279438,867,00061,840,0002,629,632
8Apr 28, 2026 22:069,400282,003,876436,976,00065,695,0002,830,336
9Apr 28, 2026 22:069,539286,174,360433,822,00065,821,0002,805,760