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:46M-RochatM-RochatScore: 63,562Success
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:4863,4381,903,150,4061,877,340,00013,744,0002,150,400
2May 18, 2026 08:4863,5161,905,492,7891,879,847,00014,103,0002,146,304
3May 18, 2026 08:4863,5561,906,689,3851,878,871,00014,053,0002,146,304
4May 18, 2026 08:4863,5611,906,841,5421,880,340,00013,546,0002,146,304
5May 18, 2026 08:4863,5621,906,877,5441,879,370,00014,060,0002,146,304
6May 18, 2026 08:4863,6381,909,157,5221,882,084,00013,919,0002,146,304
7May 18, 2026 08:4863,6511,909,551,7091,882,390,00013,845,0002,146,304
8May 18, 2026 08:4863,6511,909,548,1141,882,583,00013,616,0002,138,112
9May 18, 2026 08:4864,2731,928,217,1661,889,719,00014,692,0002,146,304