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 listJan 19, 2025 07:08AnSaAnSaScore: 524,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 07:08517,76915,533,070,85315,411,250,00082,942,0002,584,576
2Jan 19, 2025 07:08517,94815,538,448,00015,411,869,00091,945,0002,678,784
3Jan 19, 2025 07:08519,73015,591,904,88715,445,678,000111,925,0002,592,768
4Jan 19, 2025 07:08520,02115,600,629,11515,469,919,00090,928,0002,768,896
5Jan 19, 2025 07:08524,86715,746,020,66415,618,208,00083,936,0002,707,456
6Jan 19, 2025 07:08526,39115,791,729,77215,650,906,00097,930,0002,617,344
7Jan 19, 2025 07:08526,85815,805,747,43015,685,261,00090,949,0002,539,520
8Jan 19, 2025 07:08528,20015,845,995,32915,707,428,000103,930,0002,670,592
9Jan 19, 2025 07:08530,04315,901,296,03415,745,140,000111,922,0002,772,992