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 listMar 3, 2026 23:28olliecrowolliecrowScore: 11,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:2810,693320,779,999849,505,0009,982,0002,834,432
2Mar 3, 2026 23:2810,720321,604,143844,261,00011,003,0002,637,824
3Mar 3, 2026 23:2810,832324,966,732846,691,0009,996,0002,658,304
4Mar 3, 2026 23:2810,891326,715,781846,093,0008,979,0002,383,872
5Mar 3, 2026 23:2811,033330,976,956869,291,0009,980,0002,736,128
6Mar 3, 2026 23:2811,075332,260,420877,712,0009,974,0002,846,720
7Mar 3, 2026 23:2811,152334,562,637884,068,00010,988,0002,658,304
8Mar 3, 2026 23:2811,188335,645,740888,173,0009,979,0002,646,016
9Mar 3, 2026 23:2811,310339,296,055883,506,0009,994,0002,387,968