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 7, 2021 17:23Yurkov AlekseyYurkov AlekseyScore: 44,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2021 17:2344,5241,335,710,9011,279,776,17302,244,608
2Jun 7, 2021 17:2344,6171,338,511,9071,271,287,53402,240,512
3Jun 7, 2021 17:2344,7371,342,110,3581,271,253,09602,371,584
4Jun 7, 2021 17:2344,7711,343,116,4781,278,347,41902,367,488
5Jun 7, 2021 17:2345,2001,356,014,2761,281,405,16802,355,200
6Jun 7, 2021 17:2346,0681,382,028,9431,321,219,11202,355,200