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 listMar 16, 2026 14:35Dominique GarmierDominique GarmierScore: 12,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 14:3512,127363,812,153983,841,0008,989,0003,059,712
2Mar 16, 2026 14:3512,247367,411,560989,051,0008,991,0002,871,296
3Mar 16, 2026 14:3512,260367,801,931991,674,0009,986,0002,936,832
4Mar 16, 2026 14:3512,320369,610,884980,142,00010,979,0002,834,432
5Mar 16, 2026 14:3512,337370,109,720984,665,00010,985,0002,854,912
6Mar 16, 2026 14:3512,430372,906,3451,007,662,0008,988,0002,572,288
7Mar 16, 2026 14:3512,450373,506,586999,324,0007,986,0002,838,528
8Mar 16, 2026 14:3512,510375,302,9391,010,642,0006,997,0002,822,144
9Mar 16, 2026 14:3512,569377,063,2821,000,566,0008,996,0002,584,576