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 19, 2026 09:03Victor MerckléVictor MerckléScore: 5,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 09:045,513165,399,730395,551,00027,138,0002,646,016
2Jun 19, 2026 09:045,551166,538,445397,136,00027,269,0002,625,536
3Jun 19, 2026 09:045,569167,074,888394,637,00027,553,0002,646,016
4Jun 19, 2026 09:045,577167,326,701400,611,00027,126,0002,625,536
5Jun 19, 2026 09:045,585167,566,794403,055,00026,779,0002,621,440
6Jun 19, 2026 09:045,586167,591,967396,028,00027,879,0002,646,016
7Jun 19, 2026 09:045,628168,856,956402,545,00027,305,0002,641,920
8Jun 19, 2026 09:045,803174,095,102419,615,00027,254,0002,646,016
9Jun 19, 2026 09:045,841175,242,883420,127,00027,565,0002,641,920