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 08:33Andrew EpsteinAndrew EpsteinScore: 1,553Success
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 08:371,53746,125,231100,118,0002,052,0002,179,072stderr
2Oct 31, 2026 08:371,54246,281,532100,481,0002,020,0002,183,168stderr
3Oct 31, 2026 08:371,54646,407,857100,787,0002,032,0002,179,072stderr
4Oct 31, 2026 08:371,55246,577,471101,468,0002,038,0002,179,072stderr
5Oct 31, 2026 08:371,55346,592,344101,617,0002,022,0002,183,168stderr
6Oct 31, 2026 08:371,56747,013,879103,020,0002,032,0002,179,072stderr
7Oct 31, 2026 08:371,57047,104,015103,347,0002,039,0002,179,072stderr
8Oct 31, 2026 08:371,57047,117,532102,980,0002,013,0002,224,128stderr
9Oct 31, 2026 08:371,58247,487,961105,400,0001,013,0002,179,072stderr