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 listDec 3, 2024 07:54A L ManningA L ManningScore: 29,271Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2024 07:5429,041871,235,6531,641,166,00017,001,0002,674,688
2Dec 3, 2024 07:5429,188875,638,5381,645,965,00017,988,0002,523,136
3Dec 3, 2024 07:5429,194875,805,1411,635,001,00023,985,0002,670,592
4Dec 3, 2024 07:5429,224876,717,3821,654,606,00020,995,0002,928,640
5Dec 3, 2024 07:5429,271878,121,1191,642,204,00019,002,0002,560,000
6Dec 3, 2024 07:5429,291878,731,0061,652,424,00016,994,0002,576,384
7Dec 3, 2024 07:5429,292878,747,0291,633,893,00022,984,0002,834,432
8Dec 3, 2024 07:5430,378911,338,0321,717,558,00017,984,0002,969,600
9Dec 3, 2024 07:5430,597917,905,5761,735,336,00018,981,0002,519,040