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 07:56Andrew 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 07:591,45243,573,07299,284,0001,202,0002,162,688stderr
2Oct 31, 2026 07:591,47844,340,720101,955,0001,213,0002,162,688stderr
3Oct 31, 2026 07:591,48044,402,828102,181,0001,237,0002,162,688stderr
4Oct 31, 2026 07:591,50045,017,656102,500,0002,037,0002,158,592stderr
5Oct 31, 2026 07:591,50545,170,289104,597,0001,038,0002,162,688stderr
6Oct 31, 2026 07:591,57247,162,852102,672,0003,051,0002,154,496stderr
7Oct 31, 2026 07:591,82154,640,928111,281,0003,053,0002,162,688stderr
8Oct 31, 2026 07:591,93057,919,568111,585,0002,038,0002,162,688stderr
9Oct 31, 2026 07:591,98059,411,772117,344,0002,077,0002,162,688stderr