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 29, 2026 01:27Victor MerckléVictor MerckléScore: 3,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 01:293,03190,944,981229,755,0005,587,0002,707,456
2Jun 29, 2026 01:293,03290,983,560237,827,0003,208,0002,707,456
3Jun 29, 2026 01:293,03791,134,085233,809,0003,227,0002,707,456
4Jun 29, 2026 01:293,07192,141,349240,352,0003,198,0002,707,456
5Jun 29, 2026 01:293,09192,759,671238,356,0003,312,0002,703,360
6Jun 29, 2026 01:293,10393,098,959235,664,0003,297,0002,707,456
7Jun 29, 2026 01:293,11993,587,069238,949,0003,291,0002,707,456
8Jun 29, 2026 01:293,12793,829,143237,592,0004,227,0002,707,456
9Jun 29, 2026 01:293,14294,272,242237,785,0003,305,0002,707,456