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 24, 2026 02:42Victor MerckléVictor MerckléScore: 3,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 02:433,10593,179,511242,807,0003,109,0002,658,304stderr
2Jun 24, 2026 02:433,11293,371,224243,888,0003,217,0002,654,208stderr
3Jun 24, 2026 02:433,11793,521,658243,929,0003,121,0002,658,304stderr
4Jun 24, 2026 02:433,12193,654,664242,202,0003,149,0002,658,304stderr
5Jun 24, 2026 02:433,12693,799,311244,036,0003,137,0002,658,304stderr
6Jun 24, 2026 02:433,14294,281,584246,618,0003,097,0002,654,208stderr
7Jun 24, 2026 02:433,17895,350,190246,592,0003,100,0002,658,304stderr
8Jun 24, 2026 02:433,20996,275,029246,239,0003,121,0002,658,304stderr
9Jun 24, 2026 02:433,22596,752,936247,716,0003,092,0002,654,208stderr