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 17:30Shikhar SoniShikhar SoniScore: 34,483Success
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 17:3134,3791,031,392,5951,010,971,00010,123,0002,129,920
2Jun 26, 2026 17:3134,4011,032,052,5831,011,617,00010,057,0002,129,920
3Jun 26, 2026 17:3134,4041,032,127,1431,013,078,0009,079,0002,129,920
4Jun 26, 2026 17:3134,4451,033,357,4481,011,999,00011,007,0002,129,920
5Jun 26, 2026 17:3134,4831,034,519,5101,014,327,00010,131,0002,129,920
6Jun 26, 2026 17:3134,5011,035,038,9811,015,002,00010,151,0002,129,920
7Jun 26, 2026 17:3134,5241,035,724,8631,014,108,00010,116,0002,129,920
8Jun 26, 2026 17:3134,5611,036,831,0631,016,919,00010,037,0002,129,920
9Jun 26, 2026 17:3134,6131,038,405,5851,018,308,00010,178,0002,129,920