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:20TudyMTudyMScore: 10,766Success
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:2110,648319,457,470866,332,00016,024,0002,646,016
2Apr 29, 2026 14:2110,676320,291,245862,562,00015,991,0002,740,224
3Apr 29, 2026 14:2110,694320,821,086868,610,00015,992,0002,879,488
4Apr 29, 2026 14:2110,699320,981,662868,357,00017,007,0002,854,912
5Apr 29, 2026 14:2110,766322,995,556862,770,00019,994,0002,732,032
6Apr 29, 2026 14:2110,881326,455,903863,743,00016,994,0002,768,896
7Apr 29, 2026 14:2110,895326,859,464869,697,00013,010,0002,568,192
8Apr 29, 2026 14:2111,192335,777,830898,351,00018,986,0002,797,568
9Apr 29, 2026 14:2111,381341,459,738917,731,00016,976,0002,650,112