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 listOct 31, 2026 05:26Andrew EpsteinAndrew EpsteinScore: 1,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 05:301,48444,542,817102,442,0001,161,0002,158,592
2Oct 31, 2026 05:301,48744,623,123102,874,0001,168,0002,166,784
3Oct 31, 2026 05:301,49044,722,211102,915,0001,177,0002,158,592
4Oct 31, 2026 05:301,49844,963,504103,737,0001,176,0002,158,592
5Oct 31, 2026 05:301,50545,153,325104,439,0001,136,0002,166,784
6Oct 31, 2026 05:301,50845,240,911105,101,0001,115,0002,166,784
7Oct 31, 2026 05:301,50945,287,811104,884,0001,159,0002,166,784
8Oct 31, 2026 05:301,51445,444,840105,120,0001,257,0002,166,784
9Oct 31, 2026 05:301,55146,540,203103,638,0001,204,0002,166,784