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 02:47Andrew EpsteinAndrew EpsteinScore: 1,498Success
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 02:511,48444,543,687102,393,0001,123,0002,166,784
2Oct 31, 2026 02:511,48844,646,963102,212,0001,163,0002,166,784
3Oct 31, 2026 02:511,49544,855,019102,787,0001,173,0002,166,784
4Oct 31, 2026 02:511,49744,917,714103,404,0001,155,0002,166,784
5Oct 31, 2026 02:511,49844,955,140103,896,0001,140,0002,158,592
6Oct 31, 2026 02:511,50245,077,179104,076,0001,085,0002,166,784
7Oct 31, 2026 02:511,50345,117,995104,018,0001,042,0002,166,784
8Oct 31, 2026 02:511,50645,189,795102,616,0001,199,0002,166,784
9Oct 31, 2026 02:511,51245,382,400104,340,0001,064,0002,166,784