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 16:04Yuriy LyfenkoYuriy LyfenkoScore: 18,623Success
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 16:0417,910537,294,796951,332,93902,543,616
2Jun 7, 2021 16:0418,301549,020,882983,770,28602,416,640
3Jun 7, 2021 16:0418,465553,950,436979,753,43402,539,520
4Jun 7, 2021 16:0418,623558,685,156979,977,82602,433,024
5Jun 7, 2021 16:0418,657559,710,825991,675,09702,408,448
6Jun 7, 2021 16:0420,001600,039,976991,470,98802,420,736