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 7, 2026 04:27Victor MerckléVictor MerckléScore: 3,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 04:283,24797,422,644253,971,0001,156,0002,146,304
2Jun 7, 2026 04:283,27398,191,940255,459,0002,279,0002,142,208
3Jun 7, 2026 04:283,27998,378,377256,263,0002,191,0002,146,304
4Jun 7, 2026 04:283,27998,378,278258,505,0001,018,0002,142,208
5Jun 7, 2026 04:283,28498,538,786255,950,0002,207,0002,142,208
6Jun 7, 2026 04:283,28698,595,190259,072,0001,005,0002,142,208
7Jun 7, 2026 04:283,29598,874,321257,414,0002,175,0002,142,208
8Jun 7, 2026 04:283,30099,021,878257,331,0002,168,0002,142,208
9Jun 7, 2026 04:283,30799,213,699258,824,0002,203,0002,150,400