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 25, 2025 00:57Emanuele BolognesiEmanuele BolognesiScore: 51,301Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 00:5749,6721,490,163,3281,453,358,00010,995,0002,539,520
2May 25, 2025 00:5750,9061,527,185,6741,484,234,00016,991,0002,527,232
3May 25, 2025 00:5751,2081,536,242,4681,495,848,00012,990,0002,539,520
4May 25, 2025 00:5751,2561,537,689,1761,497,676,00013,996,0002,539,520
5May 25, 2025 00:5751,3011,539,028,1481,501,598,00011,996,0002,539,520
6May 25, 2025 00:5751,3241,539,728,3301,504,128,00010,993,0002,695,168
7May 25, 2025 00:5751,3891,541,670,1601,501,314,00013,993,0002,527,232
8May 25, 2025 00:5751,4601,543,808,3501,502,631,00011,997,0002,539,520
9May 25, 2025 00:5751,6261,548,774,1731,503,193,00011,993,0002,691,072