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 17:41Yuriy LyfenkoYuriy LyfenkoScore: 17,832Success
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 17:4114,764442,932,411899,155,44902,433,024
2Jun 6, 2021 17:4117,687530,618,8981,030,358,53402,428,928
3Jun 6, 2021 17:4117,761532,824,8631,018,207,70302,568,192
4Jun 6, 2021 17:4117,787533,600,6921,032,493,08302,560,000
5Jun 6, 2021 17:4117,832534,964,3081,026,997,51102,523,136
6Jun 6, 2021 17:4118,005540,154,3971,031,185,57502,322,432
7Jun 6, 2021 17:4118,199545,955,2431,025,169,93902,539,520
8Jun 6, 2021 17:4118,266547,971,5751,018,302,20502,424,832
9Jun 6, 2021 17:4118,337550,112,1381,032,504,67002,416,640