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 listMay 18, 2026 08:45M-RochatM-RochatScore: 62,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 08:4662,2031,866,115,3421,838,206,00014,192,0002,146,304
2May 18, 2026 08:4662,2341,867,023,5481,840,396,00014,082,0002,146,304
3May 18, 2026 08:4662,2501,867,503,2761,841,073,00014,047,0002,146,304
4May 18, 2026 08:4662,2641,867,932,6561,842,661,00013,823,0002,146,304
5May 18, 2026 08:4662,2781,868,352,9831,840,451,00014,747,0002,146,304
6May 18, 2026 08:4662,2791,868,386,1171,840,941,00014,094,0002,138,112
7May 18, 2026 08:4662,3101,869,321,8631,841,156,00014,106,0002,146,304
8May 18, 2026 08:4662,3101,869,325,2591,840,551,00016,511,0002,146,304
9May 18, 2026 08:4664,2221,926,663,7111,900,265,00014,223,0002,146,304