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 listJun 11, 2026 14:15Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 14:16093,411,503244,227,0003,052,0002,654,208expected "1018795 ", got "1018794 "
2Jun 11, 2026 14:163,11793,534,223245,292,0003,070,0002,654,208
3Jun 11, 2026 14:163,11993,574,545243,343,0003,092,0002,654,208
4Jun 11, 2026 14:163,12893,852,770245,519,0002,029,0002,650,112
5Jun 11, 2026 14:163,12993,897,348244,147,0003,127,0002,650,112
6Jun 11, 2026 14:163,13894,147,176244,971,0003,141,0002,654,208
7Jun 11, 2026 14:163,14194,251,563248,048,0001,021,0002,650,112
8Jun 11, 2026 14:163,14294,289,206245,341,0003,131,0002,654,208
9Jun 11, 2026 14:163,15494,641,962245,231,0003,079,0002,654,208