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:49Andrew EpsteinAndrew EpsteinScore: 1,559Success
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:571,54446,342,605100,411,0003,103,0002,179,072stderr
2Oct 31, 2026 08:571,54846,453,464100,186,0003,163,0002,179,072stderr
3Oct 31, 2026 08:571,55046,526,813100,968,0003,136,0002,179,072stderr
4Oct 31, 2026 08:571,55646,684,285101,020,0003,180,0002,179,072stderr
5Oct 31, 2026 08:571,55946,771,365101,328,0003,157,0002,179,072stderr
6Oct 31, 2026 08:571,55946,786,495101,273,0003,149,0002,179,072stderr
7Oct 31, 2026 08:571,55946,777,228101,481,0003,156,0002,179,072stderr
8Oct 31, 2026 08:571,56046,817,979101,714,0003,163,0002,179,072stderr
9Oct 31, 2026 08:571,62748,832,603103,022,0003,185,0002,232,320stderr