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 5, 2026 14:36Victor MerckléVictor MerckléScore: 6,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 14:376,010180,316,618497,723,0003,404,0002,641,920
2Jun 5, 2026 14:376,013180,407,200497,680,0003,429,0002,641,920
3Jun 5, 2026 14:376,024180,720,073499,518,0003,301,0002,646,016
4Jun 5, 2026 14:376,031180,956,261498,316,0003,501,0002,641,920
5Jun 5, 2026 14:376,078182,353,916501,601,0003,393,0002,641,920
6Jun 5, 2026 14:376,079182,399,656497,906,0004,466,0002,646,016
7Jun 5, 2026 14:376,086182,606,960501,991,0003,447,0002,641,920
8Jun 5, 2026 14:376,143184,315,343506,641,0004,391,0002,641,920
9Jun 5, 2026 14:376,165184,953,832510,320,0004,426,0002,641,920