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 7, 2026 03:45Victor 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 7, 2026 03:460210,117,007594,013,0009,158,0002,613,248expected "1026663 ", got "1026662 "
2Jun 7, 2026 03:466,964208,924,015591,239,0009,074,0002,613,248
3Jun 7, 2026 03:466,971209,141,659591,423,0008,960,0002,613,248
4Jun 7, 2026 03:466,977209,327,705592,275,0008,772,0002,613,248
5Jun 7, 2026 03:466,985209,574,714593,604,0007,656,0002,613,248
6Jun 7, 2026 03:466,995209,859,155594,221,0007,788,0002,613,248
7Jun 7, 2026 03:466,995209,850,044591,511,0009,438,0002,613,248
8Jun 7, 2026 03:467,002210,084,981594,704,0008,061,0002,613,248
9Jun 7, 2026 03:467,293218,809,405620,295,0008,731,0002,613,248