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 03:55Victor MerckléVictor MerckléScore: 3,449Success
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 03:563,411102,333,541269,319,0001,005,0002,142,208
2Jun 7, 2026 03:563,430102,902,860273,864,0001,008,0002,142,208
3Jun 7, 2026 03:563,435103,071,128270,443,0002,218,0002,146,304
4Jun 7, 2026 03:563,443103,309,715271,772,0002,152,0002,142,208
5Jun 7, 2026 03:563,449103,488,293271,598,0002,144,0002,142,208
6Jun 7, 2026 03:563,466104,007,619276,529,0001,031,0002,142,208
7Jun 7, 2026 03:563,469104,087,658275,079,0001,117,0002,142,208
8Jun 7, 2026 03:563,524105,729,571273,639,0001,181,0002,146,304
9Jun 7, 2026 03:563,569107,080,810275,045,0002,187,0002,142,208