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 listJun 6, 2021 18:13Sergey StreminSergey StreminScore: 96,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2021 18:1394,2792,828,367,7942,771,243,55002,408,448
2Jun 6, 2021 18:1394,4352,833,044,9612,771,392,83802,420,736
3Jun 6, 2021 18:1395,3862,861,589,8092,789,790,46902,408,448
4Jun 6, 2021 18:1396,1312,883,918,9002,817,830,40702,420,736
5Jun 6, 2021 18:1396,1462,884,370,9622,814,152,99002,400,256
6Jun 6, 2021 18:1396,7602,902,793,5682,810,379,56902,404,352
7Jun 6, 2021 18:1397,7612,932,841,4372,860,611,23202,412,544
8Jun 6, 2021 18:1398,3082,949,251,0822,872,787,03702,412,544
9Jun 6, 2021 18:13100,9033,027,099,8162,878,074,15502,404,352