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:58Victor MerckléVictor MerckléScore: 11,413Success
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:0011,299338,999,142574,569,00066,602,0002,752,512
2Apr 28, 2026 22:0011,336340,100,097578,876,00058,885,0002,543,616
3Apr 28, 2026 22:0011,360340,812,841577,858,00064,759,0002,768,896
4Apr 28, 2026 22:0011,378341,356,594580,589,00064,731,0002,584,576
5Apr 28, 2026 22:0011,413342,396,014579,558,00068,710,0002,772,992
6Apr 28, 2026 22:0011,447343,417,240579,402,00061,723,0002,768,896
7Apr 28, 2026 22:0011,511345,356,739579,799,00065,637,0002,547,712
8Apr 28, 2026 22:0011,640349,211,610584,825,00055,887,0002,416,640
9Apr 28, 2026 22:0011,951358,539,025587,453,00060,839,0002,547,712