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 15:35Victor MerckléVictor MerckléScore: 7,167Success
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 15:377,147214,423,791587,823,00027,194,0002,469,888
2Jun 5, 2026 15:377,153214,615,027587,070,00027,671,0002,469,888
3Jun 5, 2026 15:377,165214,960,978588,430,00027,527,0002,473,984
4Jun 5, 2026 15:377,166215,007,883587,902,00028,053,0002,469,888
5Jun 5, 2026 15:377,167215,035,005589,638,00023,744,0002,473,984
6Jun 5, 2026 15:377,182215,476,913587,396,00026,660,0002,473,984
7Jun 5, 2026 15:377,192215,771,166592,345,00025,868,0002,469,888
8Jun 5, 2026 15:377,213216,417,927592,351,00025,878,0002,465,792
9Jun 5, 2026 15:377,224216,733,380589,165,00027,314,0002,465,792