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 listApr 29, 2026 14:26TudyMTudyMScore: 11,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 14:2711,082332,463,968901,986,00018,999,0002,797,568
2Apr 29, 2026 14:2711,164334,928,098901,909,00014,998,0002,723,840
3Apr 29, 2026 14:2711,169335,093,767901,832,00015,997,0002,740,224
4Apr 29, 2026 14:2711,301339,030,392909,261,00014,987,0002,793,472
5Apr 29, 2026 14:2711,348340,446,114902,422,00010,992,0002,813,952
6Apr 29, 2026 14:2711,797353,915,710961,936,00014,013,0002,670,592
7Apr 29, 2026 14:2711,868356,046,290958,670,00013,995,0002,830,336
8Apr 29, 2026 14:2711,928357,862,401980,405,00016,955,0002,379,776
9Apr 29, 2026 14:2712,180365,407,440997,832,00017,960,0002,478,080