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 8, 2021 22:35Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 09:09Tomislav Tunkovic42.12CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 09:10011,943,3411,335,0000143,360Exit with code 2: unexpected fault address 0x7fc9a721a2ff fatal error: fault [signal SIGBUS: bus error code=0x2 addr=0x7fc9a721a2ff pc=0x48ee46] goroutine 1 [running]: runtime.throw(0x4c45ac, 0x5) /compiler/src/runtime/panic.go:774 +0x72 fp=0xc000072...stderr
2Jun 8, 2021 22:3514,883446,477,6281,138,977,66602,576,384
3Jun 8, 2021 22:3514,981449,437,9391,142,249,55602,428,928
4Jun 8, 2021 22:3515,129453,873,4911,139,416,21802,584,576