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 listSep 15, 2026 02:02Josu San MartinJosu San MartinScore: 4,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 02:034,684140,524,931195,095,0004,288,0002,142,208
2Sep 15, 2026 02:034,691140,753,376195,486,0004,135,0002,142,208
3Sep 15, 2026 02:034,692140,763,268195,413,0004,154,0002,142,208
4Sep 15, 2026 02:034,693140,792,424194,917,0004,193,0002,142,208
5Sep 15, 2026 02:034,694140,828,467195,107,0004,296,0002,142,208
6Sep 15, 2026 02:034,702141,064,601195,383,0004,151,0002,142,208
7Sep 15, 2026 02:034,706141,204,140194,992,0004,197,0002,142,208
8Sep 15, 2026 02:034,735142,070,810196,868,0003,162,0002,142,208
9Sep 15, 2026 02:034,762142,872,280197,832,0003,165,0002,142,208