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 listApr 27, 2026 22:12TudyMTudyMScore: 16,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:1916,309489,298,1891,333,689,00051,948,0002,486,272
2Apr 27, 2026 22:1916,436493,104,6331,327,137,00058,873,0002,719,744
3Apr 27, 2026 22:1916,450493,508,1791,367,484,00050,906,0003,022,848
4Apr 27, 2026 22:1916,461493,839,2601,323,065,00061,909,0002,686,976
5Apr 27, 2026 22:1916,584497,543,4891,368,133,00047,934,0002,736,128
6Apr 27, 2026 22:1916,608498,241,8661,360,574,00056,940,0002,699,264
7Apr 27, 2026 22:1916,621498,645,1951,363,249,00052,893,0002,732,032
8Apr 27, 2026 22:1916,677500,326,4841,357,357,00058,928,0002,519,040
9Apr 27, 2026 22:1916,803504,098,8171,355,907,00060,906,0002,686,976