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 26, 2026 02:02Victor MerckléVictor MerckléScore: 2,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 02:032,88386,499,137231,872,0003,019,0002,662,400
2Jun 26, 2026 02:032,90287,085,942232,404,0003,152,0002,658,304
3Jun 26, 2026 02:032,90987,287,853234,132,0003,117,0002,662,400
4Jun 26, 2026 02:032,91087,323,572233,632,0003,283,0002,662,400
5Jun 26, 2026 02:032,91987,580,300233,253,0003,084,0002,662,400
6Jun 26, 2026 02:032,93087,916,314235,729,0003,123,0002,658,304
7Jun 26, 2026 02:032,93888,142,968234,738,0003,142,0002,662,400
8Jun 26, 2026 02:032,97589,266,074235,961,0002,028,0002,662,400
9Jun 26, 2026 02:032,98189,437,833237,117,0002,101,0002,662,400