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 6, 2026 14:13Victor MerckléVictor MerckléScore: 4,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 14:144,456133,691,858365,425,0004,327,0002,641,920
2Jun 6, 2026 14:144,474134,236,679365,591,0005,469,0002,641,920
3Jun 6, 2026 14:144,491134,755,660364,217,0004,352,0002,641,920
4Jun 6, 2026 14:144,501135,052,905366,805,0004,090,0002,650,112
5Jun 6, 2026 14:144,505135,171,113371,346,0004,628,0002,646,016
6Jun 6, 2026 14:144,565136,961,948375,598,0005,539,0002,646,016
7Jun 6, 2026 14:144,565136,953,490377,640,0003,450,0002,646,016
8Jun 6, 2026 14:144,568137,063,040376,881,0004,589,0002,646,016
9Jun 6, 2026 14:144,584137,536,998368,365,0004,397,0002,641,920