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 6, 2026 14:38Victor MerckléVictor MerckléScore: 3,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 14:393,480104,411,852278,509,0001,005,0002,142,208
2Jun 6, 2026 14:393,494104,842,100275,520,0002,271,0002,146,304
3Jun 6, 2026 14:393,507105,210,687279,000,0001,013,0002,142,208
4Jun 6, 2026 14:393,511105,341,338277,463,0002,169,0002,142,208
5Jun 6, 2026 14:393,511105,336,569278,180,0002,157,0002,142,208
6Jun 6, 2026 14:393,512105,381,511277,467,0002,186,0002,142,208
7Jun 6, 2026 14:393,532105,965,678278,786,0002,178,0002,142,208
8Jun 6, 2026 14:393,553106,616,024276,038,0002,364,0002,146,304
9Jun 6, 2026 14:393,562106,878,062278,127,0002,175,0002,142,208