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 17, 2026 02:18M-RochatM-RochatScore: 20,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:2020,682620,470,387607,178,0004,046,0002,113,536
2May 17, 2026 02:2020,714621,433,217606,745,0003,298,0002,113,536
3May 17, 2026 02:2020,789623,686,012609,458,0003,401,0002,113,536
4May 17, 2026 02:2020,825624,750,034612,516,0003,341,0002,113,536
5May 17, 2026 02:2020,846625,403,210608,922,0005,290,0002,113,536
6May 17, 2026 02:2020,850625,512,922612,568,0003,362,0002,113,536
7May 17, 2026 02:2022,171665,153,600652,984,0003,009,0002,113,536
8May 17, 2026 02:2022,176665,287,479653,463,0003,005,0002,113,536
9May 17, 2026 02:2022,299668,994,885654,081,0003,009,0002,113,536