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 listApr 25, 2026 05:53olliecrowolliecrowScore: 6,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 05:546,368191,051,977473,066,0005,000,0002,588,672
2Apr 25, 2026 05:546,431192,934,721478,181,0005,989,0002,588,672
3Apr 25, 2026 05:546,437193,119,225481,499,0005,981,0002,572,288
4Apr 25, 2026 05:546,483194,493,196480,155,0004,991,0002,793,472
5Apr 25, 2026 05:546,526195,801,317483,087,0005,000,0002,580,480
6Apr 25, 2026 05:546,535196,061,804481,342,0004,993,0002,678,784
7Apr 25, 2026 05:546,544196,342,600484,168,0005,001,0002,805,760
8Apr 25, 2026 05:546,619198,583,620480,473,0005,993,0002,777,088
9Apr 25, 2026 05:546,878206,344,325498,337,0004,983,0002,576,384