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 24, 2026 02:32Victor MerckléVictor MerckléScore: 3,449Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 02:333,414102,428,406270,143,0003,121,0002,658,304stderr
2Jun 24, 2026 02:333,421102,637,081270,435,0003,120,0002,654,208stderr
3Jun 24, 2026 02:333,441103,235,438271,602,0003,115,0002,658,304stderr
4Jun 24, 2026 02:333,441103,258,705271,566,0003,090,0002,658,304stderr
5Jun 24, 2026 02:333,449103,499,389274,585,0001,011,0002,658,304stderr
6Jun 24, 2026 02:333,450103,519,014273,766,0003,126,0002,658,304stderr
7Jun 24, 2026 02:333,461103,834,675271,240,0003,063,0002,658,304stderr
8Jun 24, 2026 02:333,472104,160,506272,138,0003,061,0002,654,208stderr
9Jun 24, 2026 02:333,474104,248,236271,941,0003,525,0002,658,304stderr