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 listMay 5, 2026 12:20Victor MerckléVictor MerckléScore: 5,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 12:215,792173,779,077453,125,00014,911,0002,699,264
2May 5, 2026 12:215,798173,966,778454,003,00014,654,0002,699,264
3May 5, 2026 12:215,802174,081,761461,268,00010,865,0002,985,984
4May 5, 2026 12:215,810174,320,441455,573,00014,518,0002,715,648
5May 5, 2026 12:215,817174,534,773453,426,00012,720,0002,715,648
6May 5, 2026 12:215,827174,815,680457,046,00010,771,0002,969,600
7May 5, 2026 12:215,833175,005,603456,275,00013,219,0002,711,552
8May 5, 2026 12:215,950178,509,203459,997,00012,541,0002,711,552
9May 5, 2026 12:216,035181,059,873468,310,00010,585,0002,940,928