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 26, 2026 16:47Shikhar SoniShikhar SoniScore: 46,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 16:4846,3001,389,024,0931,207,817,000170,608,0002,117,632
2Jun 26, 2026 16:4846,3191,389,583,8171,210,265,000169,303,0002,117,632
3Jun 26, 2026 16:4846,4421,393,288,2891,209,349,000173,833,0002,117,632
4Jun 26, 2026 16:4846,4741,394,244,8761,209,377,000174,712,0002,117,632
5Jun 26, 2026 16:4846,5001,395,016,4021,210,870,000174,028,0002,117,632
6Jun 26, 2026 16:4846,5081,395,262,3421,209,492,000175,796,0002,117,632
7Jun 26, 2026 16:4846,5151,395,472,6571,212,032,000173,015,0002,117,632
8Jun 26, 2026 16:4846,5871,397,629,9841,210,622,000176,885,0002,117,632
9Jun 26, 2026 16:4846,6611,399,849,0101,211,645,000176,247,0002,117,632